Int. J. of Granular Computing, Rough Sets and Intelligent Systems   »   2013 Vol.3, No.2

 

 

Title: Parallel reducts for incremental data

 

Authors: Dayong Deng; Lin Chen; Dianxun Yan; Houkuan Huang

 

Addresses:
College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Jinhua, 321004, China
College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Jinhua, 321004, China
College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Jinhua, 321004, China
School of Computer and Information Technology, Beijing Jiaotong University, Beijing, 100044, China

 

Abstract: Parallel reducts are more suitable for dynamic data, incremental data, and multi-source 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 dataset. In this paper, some properties of parallel reducts for changing data are discussed, and an algorithm for improving parallel reducts is proposed. Some improved ideas of the algorithm are introduced to fit decreasing data and changing data. Experimental results show that the algorithm can reduce most of time for calculating a new parallel reduct when new data are increasing.

 

Keywords: rough sets; F-rough sets; parallel reducts; incremental data; attribute significance.

 

DOI: 10.1504/IJGCRSIS.2013.057239

 

Int. J. of Granular Computing, Rough Sets and Intelligent Systems, 2013 Vol.3, No.2, pp.106 - 116

 

Available online: 18 Oct 2013

 

 

Editors Full text accessAccess for SubscribersPurchase this articleComment on this article