DocumentCode :
3190593
Title :
A reduction algorithm based on trie tree of inconsistent system
Author :
Zhang, Xiaofan ; Fan, Yujun
Author_Institution :
Sch. of Mechatron. Eng., Wuhan Univ. of Technol., Wuhan, China
fYear :
2011
fDate :
8-10 Aug. 2011
Firstpage :
6935
Lastpage :
6939
Abstract :
Attribute reduction is one of the vital research contents of Rough Sets. A method of calculating positive region based on the trie tree has been proposed in the paper. And the time complexity is O (| C || U |). A complete attribute reduction algorithm has been designed according to the method of calculating positive region. The experiment results show that the reduction algorithm is effective, and it is applicable to the reduction of mass data.
Keywords :
computational complexity; data reduction; rough set theory; trees (mathematics); attribute reduction algorithm; inconsistent system; mass data reduction; rough sets; time complexity; trie tree; vital research content; Algorithm design and analysis; Complexity theory; Computers; IP networks; Information systems; Machine learning algorithms; Rough sets; Inconsistency; Rough Sets; Trie tree; reduction;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC), 2011 2nd International Conference on
Conference_Location :
Deng Leng
Print_ISBN :
978-1-4577-0535-9
Type :
conf
DOI :
10.1109/AIMSEC.2011.6011475
Filename :
6011475
Link To Document :
بازگشت