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.
Research on an efficient rough Set based attribute reduction algorithm
01.06.2010
726663 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
An Approach of Attribute Reduction Based on Quantum Genetic Algorithm and Rough Set
British Library Online Contents | 2011
|Reduction of Rough Set Attribute Based on Immune Clone Selection
British Library Online Contents | 2005
|Efficient Genetic Reduction Algorithm for Rough Sets
British Library Online Contents | 2007
|Discrimination Method of Rough Set Attribute Reduction and Its Applications
British Library Online Contents | 2007
|