DocumentCode :
3041369
Title :
An Efficient Algorithm for Attribute Reduction Based on Discernibility Matrix
Author :
Zhang, Juan ; Dong, A´ni ; Niu, Yi ; Nie, Huabei
Author_Institution :
City Coll., Dongguan Univ. of Technol., Dongguan, China
fYear :
2011
fDate :
14-17 Dec. 2011
Firstpage :
175
Lastpage :
178
Abstract :
A definition for reducing discernibility matrix is provided, and a reduction relative of discernibility set is analyzed to reduce the time complexity of attribute reduction algorithm based on traditional matrix. Use iterative idea to select the necessary condition attributes adding to this reduction relative. Optimize the reduction relative by complete optimization theory and resulting in a Pawlak reduction. Simulation results show the efficiency of the new algorithm.
Keywords :
optimisation; rough set theory; Pawlak reduction; attribute reduction algorithm; discernibility matrix; optimization theory; time complexity; traditional matrix; Algorithm design and analysis; Cities and towns; Complexity theory; Educational institutions; Heuristic algorithms; Manganese; Symmetric matrices; attribute reduction; complete algorithm; discernibility matrix; rough set;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Computation and Bio-Medical Instrumentation (ICBMI), 2011 International Conference on
Conference_Location :
Wuhan, Hubei
Print_ISBN :
978-1-4577-1152-7
Type :
conf
DOI :
10.1109/ICBMI.2011.47
Filename :
6131740
Link To Document :
بازگشت