DocumentCode
2889931
Title
Attributes Reduction Based on Rough Set
Author
Xu, Eric ; Gao, Xue-dong ; Tan, Wen-dong
Author_Institution
Dept. of Comput. Sci., Liaoning Inst. of Technol., Jinzhou
fYear
2006
fDate
13-16 Aug. 2006
Firstpage
1438
Lastpage
1442
Abstract
Attributes reduction is one major problems in rough set theory. A method of attributes reduction based on scan vector is proposed in this paper. Firstly, define a new conception of discernible vector by which we can transform the information table into discernible vector set. Secondly, a plus rule for the discernible vector based on its good structure is defined, and consequently we can obtain a scan vector through scanning the discernible vector just only one time, which can represent the information table better because the scan vector has a more concise structure. And then, take the attribute frequency vector in the scan vector as the heuristic information and search for the attributes reduction in the discernible attributes set which has less numbers of elements than the original. Finally, the experiments results indicate that the method proposed in this paper is much more effective
Keywords
heuristic programming; rough set theory; attribute frequency vector; discernible vector; heuristic information; rough set theory; scan vector; Artificial intelligence; Clustering algorithms; Conference management; Cybernetics; Data mining; Fellows; Frequency; Information systems; Machine learning; Machine learning algorithms; Set theory; Technology management; Rough set; attribute reduction; discernible vector; information table;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Cybernetics, 2006 International Conference on
Conference_Location
Dalian, China
Print_ISBN
1-4244-0061-9
Type
conf
DOI
10.1109/ICMLC.2006.258755
Filename
4028290
Link To Document