.png){kind=icon}
返回
A dynamic attribute reduction algorithm based on 0-1 integer programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2011.06.007.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Attribute reduction is an important research concept in rough set theory. Many attribute reduction algorithms were designed for the static information system in the past years. However, many real-world data are generated dynamically. Then a new dynamic attribute reduction algorithm based on a 0-1 integer programming is proposed to deal with the dynamic data in this paper. When multiple objects in the information system evolve over time, instead of treating the changed information table as a new one and finding the reduct again like rough set reduction algorithm does, the proposed algorithm just updates the original reduct. Therefore, its computational speed improves greatly. In addition, an approach of constraint preprocessing is also presented in this paper. Numerical experiments on twelve benchmark data-sets testify the feasibility and validity of the proposed algorithm. Crown Copyright (C) 2011 Published by Elsevier B.V. All rights reserved.
Keyword:
Rough set theory
Attribute reduction
Dynamic reduct
0-1 Integer programming
Constraint preprocessing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.2W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏分享收藏
查看更多内容