期刊
INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS
卷 11, 期 6, 页码 1339-1355出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s13042-020-01065-y
关键词
Attribute reduction; Dynamic datasets; Discernibility relation; Incremental mechanism; Rough set
资金
- North China Electric Power University
- Fundamental Research Funds for the Central Universities [2018QN050]
Attribute reduction with rough set is a popular data analysis methodology for data dimensionality reduction. For dynamic datasets, the existing research has mainly focused on incremental attribute reduction with increasing samples (rows) or attributes (columns), but there is hardly any further research on attribute reduction for dynamic datasets with simultaneously increasing samples and attributes. This paper presents a novel incremental algorithm for attribute reduction with rough set. Firstly, the definition of discernibility relation is proposed based on the improved discernibility matrix. Then, the incremental mechanisms of samples and attributes are studied in terms of discernibility relation under a unified framework. On the basis of two incremental mechanisms, a unified incremental mechanism is introduced for dynamic datasets with simultaneously increasing samples and attributes, and the incremental algorithm is developed according to the unified incremental mechanism. The proposed algorithm has the solid mathematical foundation, which is also suitable for datasets with massive samples and attributes. Finally, compared experimentally with other algorithms, the efficiency of the developed incremental algorithm is demonstrated in terms of running time.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据