Rough set is a valid mathematical theory developed in recent years, which has the ability to deal with imprecise and uncertain information. It has been proven that computing all the reductions and the minimal reduction of information system is a NP-hard problem. In this paper, a coding and sorting method is proposed to reduce the computational complexity of indiscernibility relation and positive region computation, and so attribute reduction can be obtained efficiently. Experimental results showed that the proposed algorithm computed attribute reduction efficiently.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Research on an efficient rough Set based attribute reduction algorithm


    Contributors:
    Jun Wang, (author) / Xiu-Feng Zhong, (author) / Xi-Yuan Peng, (author)


    Publication date :

    2010-06-01


    Size :

    726663 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Reduction of Rough Set Attribute Based on Immune Clone Selection

    Lin, L. / Guanghua, X. | British Library Online Contents | 2005


    Efficient Genetic Reduction Algorithm for Rough Sets

    Jiangwei, Z. / Boqin, F. / Yang, L. | British Library Online Contents | 2007


    Discrimination Method of Rough Set Attribute Reduction and Its Applications

    Hongjie, L. / Boqin, F. / Wenjie, L. | British Library Online Contents | 2007