DocumentCode :
2221164
Title :
A Simplified Discernibility Matrix of the Attribute Reduction Method
Author :
Hao, Weilai ; Zhang, Xuebin
Author_Institution :
Grad. Inst., Heilongjiang Inst. of Sci. & Technol., Harbin, China
Volume :
2
fYear :
2010
fDate :
26-28 Nov. 2010
Firstpage :
166
Lastpage :
168
Abstract :
According to existing have defects discernibility matrix, and the attribute reduction algorithm for attribute reduction algorithm of complex process. This paper made part of optimization, based on the condition attributes classify the grouping generated representative data to simplify the discernibility matrix, and the order of the discernibility matrix, and the complexity of the attribute reduction. Thus the time complexity and space complexity made optimization, save the time and space complexity. From the example we can know that the algorithm can effectively for attribute reduction, can get ideal result. From the actual application can test the method is simple and effective. Improve the speed of attribute reduction algorithm. This method is further research about the rough set attribute reduction algorithm.
Keywords :
computational complexity; data analysis; data mining; matrix algebra; optimisation; rough set theory; attribute reduction method; data mining; discernibility matrix; optimization; space complexity; time complexity; algorithm; discernibility matrix; domain; reduction;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Management, Innovation Management and Industrial Engineering (ICIII), 2010 International Conference on
Conference_Location :
Kunming
Print_ISBN :
978-1-4244-8829-2
Type :
conf
DOI :
10.1109/ICIII.2010.204
Filename :
5694543
Link To Document :
بازگشت