DocumentCode :
507064
Title :
Quick Complete Attribute Reduction Algorithm
Author :
Yang, Chuanjian ; Ge, Hao ; Yao, Guangshun ; Ma, Lisheng
Author_Institution :
Dept. of Comput. Sci., Chuzhou Univ., Chuzhou, China
Volume :
4
fYear :
2009
fDate :
14-16 Aug. 2009
Firstpage :
576
Lastpage :
580
Abstract :
To improve the efficiency of attribute reduction and obtain the minimal attribute reduction, the notion of consistent simplified decision table is proposed. The concentrated discernibility set is created in the consistent simplified decision table, and an algorithm of completeness attribute reduction based on concentrated discernibility set is put forward. The least information of attribute reduction is withheld in concentrated the discernibility set, so the efficiency of the algorithm is improved. In addition, the heuristic method is used to select the deleted attribute, which better ensure to acquire the minimal reduction. The experimental results show that the algorithm is correct and effective.
Keywords :
rough set theory; concentrated discernibility set; heuristic method; minimal attribute reduction; quick complete attribute reduction algorithm; rough set theory; simplified decision table; Computer science; Frequency shift keying; Fuzzy systems; Heuristic algorithms; Rough sets; Set theory; Uncertainty; attribute reduction; concentrated discernibility set; discernibility matrix; rough set;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Fuzzy Systems and Knowledge Discovery, 2009. FSKD '09. Sixth International Conference on
Conference_Location :
Tianjin
Print_ISBN :
978-0-7695-3735-1
Type :
conf
DOI :
10.1109/FSKD.2009.527
Filename :
5359246
Link To Document :
بازگشت