DocumentCode :
3172678
Title :
Similarity matrix-based algorithm for reduction of attribute in incomplete information systems
Author :
Lv, Yuejin ; Li, Shuyan ; Wei, Bipeng
Author_Institution :
Coll. of Math. & Inf. Sci., Guangxi Univ., Nanning, China
fYear :
2011
fDate :
8-10 Aug. 2011
Firstpage :
1503
Lastpage :
1506
Abstract :
Aiming at the matter of the heavy workload of discernibility matrix and the inefficient of the reduction strategy based on discernibility matrix, this paper proposes a new attributes reduction arithmetic-based similarity matrix. In this paper, We firstly constructs the correlation between similarity relation and matrix, puts forward a new index of attribute significance, and used the new index as heuristic information to design a new attribute reduction algorithm. The algorithm proposed in this paper can avoid repeatedly calculation important value of unimportant attributes and decrease the temporal complexity.
Keywords :
computational complexity; information theory; matrix algebra; rough set theory; attribute reduction arithmetic based similarity matrix; discernibility matrix; incomplete information system; similarity matrix based algorithm; temporal complexity; unimportant attribute; Algorithm design and analysis; Complexity theory; Computers; Heuristic algorithms; Indexes; Rough sets; attributes reduction; rough sets; similarity relation;
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.6010520
Filename :
6010520
Link To Document :
بازگشت