A formal concept analysis based approach to minimal value reduction

Abstract

Reduction is a core issue in Rough Set Theory. Current reductions falls into 3 categories: tuple reduction, attribute reduction and value reduction. From the reduced tables, decision rules can be derived. For the purpose of storage and better understanding, minimization of the rule set is desired, and it is NP-hard. To tackle this problem, a heuristic approach to approximate minimal value reduct set is proposed based on Formal Concept Analysis in this paper. Experiments show that our approach is valid with a higher accuracy. © 2013 Springer-Verlag.