.png){kind=icon}
返回
Accelerating incremental attribute reduction algorithm by compacting a decision table
.png){kind=icon}
PRE
AI
DOI：10.1007/s13042-018-0874-x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The evolution of object sets over time is ubiquitous in dynamic data. To acquire reducts for this type of data, researchers have proposed many incremental attribute reduction algorithms based on discernibility matrices. Although all reducts of an updated decision table can be obtained using these algorithms, their high computation time is a critical issue. To address this issue, we first construct three new types of discernibility matrices by compacting a decision table to eliminate redundant entries in the discernibility matrices of the original decision table. We then demonstrate that the set of reducts obtained from the compacted decision table are the same as those acquired from the original decision table. Extensive experiments have demonstrated that an incremental attribute reduction algorithm based on a compacted decision table can significantly accelerate attribute reduction for dynamic data with changing object sets while the acquired reducts are identical to those obtained using existing algorithms.
Keyword:
Rough set
Incremental attribute reduction
Discerptiblity matrix
Compacted decision table
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.7
论文数:
3.2K
被引数:
5.6K
机构
引用论文
A Group Incremental Approach to Feature Selection Applying Rough Set Technique应用粗糙集技术的组增量式特征选择方法
PREAI
分享收藏Late gadolinium enhancement on cardiac magnetic resonance combined with 123I- metaiodobenzylguanidine scintigraphy strongly predicts long-term clinical outcome in patients with dilated cardiomyopathy.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏分享收藏
查看更多内容