DocumentCode :
2144846
Title :
An Algorithm for Attribute Reduction Based on Distance of Partitions
Author :
Li, Min ; Deng, Shaobo ; Shengzhong, Feng ; Jian-Ping Fan
Author_Institution :
Dept. of Comput. Sci. & Technol., Nanchang Inst. of Technol., Nanchang, China
fYear :
2010
fDate :
14-16 Aug. 2010
Firstpage :
700
Lastpage :
703
Abstract :
This paper introduces an attribute reduction algorithm according to heuristic information based on the distance between partitions. It is quite different from other algorithms which seek for minimum reduction, and the algorithm tends to find out a space close to decision-making division of attribute reduction. The attribute reduction algorithm is beneficial to the generation of strong rules.
Keywords :
decision making; rough set theory; attribute reduction algorithm; decision-making division; heuristic information; Algorithm design and analysis; Decision trees; Entropy; Heuristic algorithms; Humidity; Partitioning algorithms; Rough set; attribute reduction; heuristic information;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Granular Computing (GrC), 2010 IEEE International Conference on
Conference_Location :
San Jose, CA
Print_ISBN :
978-1-4244-7964-1
Type :
conf
DOI :
10.1109/GrC.2010.36
Filename :
5576043
Link To Document :
بازگشت