DocumentCode :
2923458
Title :
Parallel reduction based on condition attributes
Author :
Deng, Dayong ; Yan, Dianxun ; Chen, Lin
Author_Institution :
Coll. of Math., Phys. & Inf. Eng., Zhejiang Normal Univ., Jinhua, China
fYear :
2011
fDate :
8-10 Nov. 2011
Firstpage :
162
Lastpage :
166
Abstract :
In this paper, we propose a parallel algorithm to obtain reducts. The algorithm firstly divides the decision system into a number of subsystems, then reduce conditional attributes in each subsystem, and merge some subsystems together. This process repeats until all subsystems are merged into one. In this way, conditional attributes are reduced efficiently. The effectiveness of our method is analyzed and validated through experiments on seven datasets.
Keywords :
parallel algorithms; rough set theory; condition attributes; conditional attributes; decision system; parallel algorithm; parallel reduction; Complexity theory; Computers; Conferences; Educational institutions; Heuristic algorithms; Information systems; Rough sets; decomposition; dynamic reducts; parallel reducts; rough sets;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Granular Computing (GrC), 2011 IEEE International Conference on
Conference_Location :
Kaohsiung
Print_ISBN :
978-1-4577-0372-0
Type :
conf
DOI :
10.1109/GRC.2011.6122586
Filename :
6122586
Link To Document :
بازگشت