还原
粗集
还原(数学)
样品(材料)
样品空间
算法
数据挖掘
计算机科学
过程(计算)
选择(遗传算法)
集合(抽象数据类型)
属性域
削减战略
数学
人工智能
色谱法
操作系统
化学
几何学
程序设计语言
作者
Yanyan Yang,Degang Chen,Hui Wang
出处
期刊:IEEE Transactions on Fuzzy Systems
[Institute of Electrical and Electronics Engineers]
日期:2016-06-15
卷期号:25 (4): 825-838
被引量:84
标识
DOI:10.1109/tfuzz.2016.2581186
摘要
Attribute reduction with rough sets is an effective technique for obtaining a compact and informative attribute set from a given dataset.However, traditional algorithms have no explicit provision for handling dynamic datasets where data present themselves in successive samples.Incremental algorithms for attribute reduction with rough sets have been recently introduced to handle dynamic datasets with large samples, though they have high complexity in time and space.To address the time/space complexity issue of the algorithms, this paper presents a novel incremental algorithm for attribute reduction with rough sets based on the adoption of an active sample selection process and an insight into the attribute reduction process.This algorithm first decides whether each incoming sample is useful with respect to the current dataset by the active sample selection process.A useless sample is discarded while a useful sample is selected to update a reduct.At the arrival of a useful sample, the attribute reduction process is then employed to guide how to add and/or delete attributes in the current reduct.The two processes thus constitute the theoretical framework of our algorithm.The proposed algorithm is finally experimentally shown to be efficient in time and space. Index Terms-Rough sets, attribute reduction
科研通智能强力驱动
Strongly Powered by AbleSci AI