.png){kind=icon}
返回
An incremental approach for attribute reduction based on knowledge granularity
.png){kind=icon}
OA
AI
DOI：10.1016/j.knosys.2016.04.007.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Rough set provides a theoretical framework for classification learning in data mining and knowledge discovery. As an important application of rough set, attribute reduction, also called feature selection, aims to reduce the redundant attributes in a given decision system while preserving a particular classification property, e.g., information entropy and knowledge granularity. In view of the dynamic changes of the object set in a decision system, in this paper, we focus on knowledge granularity-based attribute reduction approach when some objects vary dynamically. We first introduce incremental mechanisms to compute new knowledge granularity. Then, the corresponding incremental algorithms for attribute reduction are developed when some objects are added into and deleted from the decision System. Experiments conducted on different data sets from UCI show that the proposed incremental algorithm can achieve better performance than the non-incremental counterpart and incremental algorithm based on entropy. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Decision system
Incremental learning
Knowledge granularity
Attribute reduction
Rough set theory
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
Feature selection using rough entropy-based uncertainty measures in incomplete decision systems
PREAI
分享收藏Updating attribute reduction in incomplete decision systems with the variation of attribute set利用属性集的变化更新不完备决策系统的属性约简OAAI
OAAI分享收藏
查看更多内容