Core-generating discretization for rough set feature selection

    Research output: Contribution to journalArticlepeer-review


    Rough set feature selection (RSFS) can be used to improve classifier performance. RSFS removes redundant attributes whilst keeping important ones that preserve the classification power of the original dataset. The feature subsets selected by RSFS are called reducts. The intersection of all reducts is called core. However, RSFS handles discrete attributes only. To process datasets consisting of real attributes, they are discretized before applying RSFS. Discretization controls core of the discrete dataset.Moreover, core may critically affect the classification performance of reducts. This paper defines core-generating discretization, a typeof discretization method; analyzes the properties of core-generating discretization; models core-generating discretization using constraint satisfaction; defines core-generating approximate minimum entropy (C-GAME) discretization; models C-GAME using constraint satisfaction and evaluates the performance of C-GAME as a pre-processor of RSFS using ten datasets from the UCI Machine Learning Repository. © 2011 Springer-Verlag Berlin Heidelberg.
    Original languageEnglish
    Pages (from-to)135-158
    Number of pages23
    JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Publication statusPublished - 2011


    • Constraint satisfactio
    • Core-generating approximate minimum entropy discretization
    • Core-generating discretization
    • Rough set feature selection


    Dive into the research topics of 'Core-generating discretization for rough set feature selection'. Together they form a unique fingerprint.

    Cite this