Journal
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING
Volume 56, Issue -, Pages 43-58Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ijar.2014.09.001
Keywords
Covering-based rough sets; Formal concept analysis; Approximation operator; Concept lattice; Knowledge reduction; Algorithm
Categories
Funding
- National Natural Science Foundation of China [61379021, 11301367, 11061004, 61305057, 61303131]
- Department of Education, Fujian Province [JA13202, JK2013027]
Ask authors/readers for more resources
Covering-based rough sets and formal concept analysis are two complementary tools for data analysis. This study systematically explores their connections in terms of approximation operators, structures and knowledge reduction. First, we show that three pairs of approximation operators-element-based, granule-based and subsystem-based, in covering-based rough sets, are accordant with the approximation operators in formal concept analysis. On this basis, one can easily conclude that the approximation spaces of coverings and concept lattices are related and that their reducts are coincident. Second, the high-level approximation operators of formal concept analysis are introduced into covering-based rough sets. In the end, we construct several reduction algorithms for a covering that could also be used to compute the reducts of a formal context. Experiments are conducted to assess their efficiencies. (C) 2014 Elsevier Inc. 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