.png){kind=icon}
返回
An enhancement for heuristic attribute reduction algorithm in rough set
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2014.04.042.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Attribute reduction is one of the most important issues in the research of rough set theory. Numerous significance measure based heuristic attribute reduction algorithms have been presented to achieve the optimal reduct. However, how to handle the situation that multiple attributes have equally largest significances is still largely unknown. In this regard, an enhancement for heuristic attribute reduction (EHAR) in rough set is proposed. In some rounds of the process of adding attributes, those that have the same largest significance are not randomly selected, but build attribute combinations and compare their significances. Then the most significant combination rather than a randomly selected single attribute is added into the reduct. With the application of EHAR, two representative heuristic attribute reduction algorithms are improved. Several experiments are used to illustrate the proposed EHAR. The experimental results show that the enhanced algorithms with EHAR have a superior performance in achieving the optimal reduct. (C) 2014 Elsevier Ltd. All rights reserved.
Keyword:
Rough set
Heuristic
Attribute reduction
Enhancement for heuristic attribute reduction
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
.png){kind=icon}
Information gain and divergence-based feature selection for machine learning-based text categorization基于信息增益和散度的特征选择，用于基于机器学习的文本分类
PREAI
分享收藏
分享收藏
查看更多内容