.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Rough set theory
Attribute reduction
Dynamic reduct
0-1 Integer programming
Constraint preprocessing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
K
IF:
7.6
Papers:
1.2W
Citations:
4.5W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSave
ShareSaveShareSaveShareSave
View more