.png){kind=icon}
.png){kind=icon}
Return
Incremental reduction algorithm with acceleration strategy based on conflict region
.png){kind=icon}
PRE
AI
DOI：10.1007/s10462-017-9570-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Attribute reduction plays a vital role in many areas of data mining and knowledge discovery. In the real world, several data sets may vary dynamically and many incremental reduction algorithms have been proposed to update reduct. Further improvement of the performance of the incremental reduction approach is an important task that can help to increase the efficiency of knowledge discovery in dynamic data systems. This paper researches incremental reduction algorithms via an acceleration strategy to compute new reduct based on conflict region. We firstly introduce the concepts and propositions of the conflict region and give a static reduction algorithm based on the conflict region. Consequently, incremental mechanisms based on the conflict region and an acceleration strategy for reduction are discussed. Then, two incremental reduction algorithms for updating new reduct when one single object and multi-objects are added to decision systems are developed. Finally, experiments on different data sets from UCI show the effectiveness and efficiency of the proposed algorithms in decision systems with the addition of objects.
Keywords:
Rough set
Incremental reduction
Dynamic data set
Conflict region
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W