Journal
KNOWLEDGE-BASED SYSTEMS
Volume 162, Issue -, Pages 161-173Publisher
ELSEVIER
DOI: 10.1016/j.knosys.2018.05.019
Keywords
Attribute reduction; Dynamic covering information system; Granular computing; Related family; Rough sets
Categories
Funding
- National Natural Science Foundation of China [61603063, 61673301, 11771059, 61573255]
- Hunan Provincial Natural Science Foundation of China [2018JJ2027, 2018JJ3518]
- Scientific Research Fund of Hunan Provincial Education Department [15B004]
- Fundamental Research Funds for the Central University
Ask authors/readers for more resources
Many efforts have focused on studying techniques for selecting most informative features from data sets. Especially, the related family-based approaches have been provided for attribute reduction of covering information systems. However, the existing related family-based methods have to recompute reducts for dynamic covering decision information systems. In this paper, firstly, we investigate the mechanisms of updating the related families and attribute reducts by the utilization of previously learned results in dynamic covering decision information systems with variations of attributes. Then, we design incremental algorithms for attribute reduction of dynamic covering decision information systems in terms of attribute arriving and leaving using the related families and employ examples to demonstrate that how to update attribute reducts with the proposed algorithms. Finally, experimental comparisons with the non-incremental algorithms on UCI data sets illustrate that the proposed incremental algorithms are feasible and efficient to conduct attribute reduction of dynamic covering decision information systems with immigration and emigration of attributes.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available