DocumentCode :
3430532
Title :
Parallel reducts for incremental data
Author :
Deng, Dayong ; Chen, Lin ; Yan, Dianxun ; Huang, Houkuan
Author_Institution :
College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Jinhua, China, 321004
fYear :
2012
fDate :
11-13 Aug. 2012
Firstpage :
84
Lastpage :
88
Abstract :
Parallel reducts are more suitable for dynamic and incremental data than other reducts, and can be obtained by attribute significance in a family of decision subsystems. However, when data are increasing, they should be improved or changed to fit the new data set. In this paper, some properties of parallel reducts for changing data are discussed, and an algorithm for improving parallel reducts is proposed. Experimental results show that the algorithm can reduce most of time for calculating new parallel reduct when new data are increasing.
Keywords :
Diffusion tensor imaging; Integrated circuits; attribute significance; incremental data; parallel reducts; rough sets;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Granular Computing (GrC), 2012 IEEE International Conference on
Conference_Location :
Hangzhou, China
Print_ISBN :
978-1-4673-2310-9
Type :
conf
DOI :
10.1109/GrC.2012.6468575
Filename :
6468575
Link To Document :
بازگشت