.png){kind=icon}
返回
Incremental attribute reduction approaches for ordered data with time-evolving objects
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2020.106583.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Dominance-based rough set approach (DRSA) is widely applied to multi-criteria decision analysis and sorting problems for data with preference-ordered relation, where attribute reduction is an important research field. At present, based on DRSA, many traditional attribute reduction approaches are extended to process a static ordered data. In real-world applications, ordered data with time-evolving objects widely exist, which is called a dynamic ordered data. However, for dynamic ordered data, employing these existing approaches to compute reducts is very time-consuming, since they need to recalculate knowledge from scratch when multiple objects vary. Incremental updating method can effectively complete the dynamic learning task, because it can acquire new knowledge based on previous knowledge. Inspired by this, this work studies incremental attribute reduction approaches for dynamic ordered data in DRSA framework. First, matrix-based method for calculating the dominance conditional entropy is investigated. Next, the updating principles of the dominance relation matrix and dominance diagonal matrix are studied when objects vary. Finally, two incremental algorithms of attribute reduction are proposed when multiple objects are added to or deleted from an ordered decision system, respectively. Experiments on different datasets provided by University of California at Irvine (UCI) are conducted to evaluate the proposed algorithms. Experimental results show that the proposed incremental algorithms can effectively and efficiently accomplish the task of attribute reduction in dynamic ordered data. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Ordered decision system
Dominance-based rough set approach
Attribute reduction
Dominance conditional entropy
Incremental algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
Active Sample Selection Based Incremental Algorithm for Attribute Reduction With Rough Sets基于主动样本选择的增量式粗糙集属性约简算法
OAAI
OAAI分享收藏A Group Incremental Approach to Feature Selection Applying Rough Set Technique应用粗糙集技术的组增量式特征选择方法
PREAI
分享收藏
查看更多内容