Journal
KNOWLEDGE-BASED SYSTEMS
Volume 118, Issue -, Pages 93-104Publisher
ELSEVIER
DOI: 10.1016/j.knosys.2016.11.010
Keywords
Attribute reduction; Decision systems; Rough sets; Hypergraphs; Vertex covers
Categories
Funding
- National Natural Science Foundation of China [61379021, 61672272, 61303131, 61603173, 11526109]
- Natural Science Foundation of Fujian Province [2016J01314, 2016J01315]
- Department of Education of Fujian Province [JK2013027, JA13202, JA14192]
- Program for New Century Excellent Talents in Fujian Province University
Ask authors/readers for more resources
Attribute reduction (also called feature subset selection) plays an important role in rough set theory. Different from the classical attribute reduction algorithms, the methods of attribute reduction based on covering rough sets appear to be suitable for numerical data. However, it is time-consuming in dealing with the large-scale data. In this paper, we study the problem of attribute reduction of covering decision systems based on graph theory. First, we translate this problem into a graph model and show that finding the attribute reduction of a covering decision system is equivalent to finding the minimal vertex cover of a derivative hypergraph. Then, based on the proposed model, a thm for covering decision systems is presented. Experiments show that the new proposed method is more effective to handle the large-scale data. (C) 2016 Elsevier B.V. All rights reserved.
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