Issue No. 11 - Nov. (2012 vol. 24)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2011.89
Degang Chen , North China Electric Power University, Beijing
Suyun Zhao , Renmin University of China, China
Lei Zhang , The Hong Kong Polytechnic University, Hong Kong
Yongping Yang , North China Electric Power University, Beijing
Xiao Zhang , North China Electric Power University, Beijing
Attribute reduction is the strongest and most characteristic result in rough set theory to distinguish itself to other theories. In the framework of rough set, an approach of discernibility matrix and function is the theoretical foundation of finding reducts. In this paper, sample pair selection with rough set is proposed in order to compress the discernibility function of a decision table so that only minimal elements in the discernibility matrix are employed to find reducts. First relative discernibility relation of condition attribute is defined, indispensable and dispensable condition attributes are characterized by their relative discernibility relations and key sample pair set is defined for every condition attribute. With the key sample pair sets, all the sample pair selections can be found. Algorithms of computing one sample pair selection and finding reducts are also developed; comparisons with other methods of finding reducts are performed with several experiments which imply sample pair selection is effective as preprocessing step to find reducts.
sample pair core, Rough set, attribute reduction, sample pair selection
Y. Yang, L. Zhang, S. Zhao, D. Chen and X. Zhang, "Sample Pair Selection for Attribute Reduction with Rough Set," in IEEE Transactions on Knowledge & Data Engineering, vol. 24, no. , pp. 2080-2093, 2012.