A heuristic knowledge-reduction method for decision formal contexts

Computing a minimal reduct of a decision formal context by Boolean reasoning is an NP-hard problem. Thus, it is essential to develop some heuristic methods to deal with the issue of knowledge reduction especially for large decision formal contexts. In this study, we first investigate the relationship between the concept lattice of a formal context and those of its subcontexts in preparation for deriving a heuristic knowledge-reduction method. Then, we construct a new framework of knowledge reduction in which the capacity of one concept lattice implying another is defined to measure the significance of the attributes in a consistent decision formal context. Based on this reduction framework, we formulate an algorithm of searching for a minimal reduct of a consistent decision formal context. It is proved that this algorithm is complete and its time complexity is polynomial. Some numerical experiments demonstrate that the algorithm can generally obtain a minimal reduct and is much more efficient than some Boolean reasoning-based methods.

[1]  R. Wille.  Concept lattices and conceptual knowledge systems , 1992 .

[2]  Yiyu Yao,et al.  A Comparative Study of Formal Concept Analysis and Rough Set Theory in Data Analysis , 2004, Rough Sets and Current Trends in Computing.

[3]  Manfred M. Fischer,et al.  A Rough Set Approach for the Discovery of Classification Rules in Interval-Valued Information Systems , 2008, Int. J. Approx. Reason..

[4]  Hong Wang,et al.  Approaches to knowledge reduction in generalized consistent decision formal context , 2008, Math. Comput. Model..

[5]  Bernhard Ganter,et al.  Formal Concept Analysis , 2013 .

[6]  Claudio Carpineto,et al.  GALOIS: An Order-Theoretic Approach to Conceptual Clustering , 1993, ICML.

[7]  Robert E. Kent,et al.  Rough Concept Analysis: A Synthesis of Rough Sets and Formal Concept Analysis , 1996, Fundam. Informaticae.

[8]  Gerd Stumme,et al.  Conceptual Knowledge Discovery in Databases Using Formal Concept Analysis Methods , 1998, PKDD.

[9]  Wen-Xiu Zhang,et al.  Attribute reduction theory of concept lattice based on decision formal contexts , 2008, Science in China Series F: Information Sciences.

[10]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[11]  Lhouari Nourine,et al.  A Fast Algorithm for Building Lattices , 1999, Inf. Process. Lett..

[12]  Wen-Xiu Zhang,et al.  Variable threshold concept lattices , 2007, Inf. Sci..

[13]  Rudolf Wille,et al.  Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts , 2009, ICFCA.

[14]  Dan Corbett,et al.  A basic mathematical framework for conceptual graphs , 2006, IEEE Transactions on Knowledge and Data Engineering.

[15]  Ming-Wen Shao,et al.  Reduction method for concept lattices based on rough set theory and its application , 2007, Comput. Math. Appl..

[16]  Zhang Wen-xiu,et al.  Attribute reduction theory and approach to concept lattice , 2005 .

[17]  Wang Guo,et al.  Decision Table Reduction based on Conditional Information Entropy , 2002 .

[18]  Yee Leung,et al.  Granular Computing and Knowledge Reduction in Formal Contexts , 2009, IEEE Transactions on Knowledge and Data Engineering.

[19]  Wei-Zhi Wu,et al.  Attribute reduction based on evidence theory in incomplete decision systems , 2008, Inf. Sci..

[20]  Rokia Missaoui,et al.  INCREMENTAL CONCEPT FORMATION ALGORITHMS BASED ON GALOIS (CONCEPT) LATTICES , 1995, Comput. Intell..

[21]  Wei-Zhi Wu,et al.  Approaches to knowledge reduction based on variable precision rough set model , 2004, Inf. Sci..

[22]  Tu Bao Ho,et al.  An Approach to Concept Formation Based on Formal Concept Analysis , 1995, IEICE Trans. Inf. Syst..

[23]  Wang Ju,et al.  Reduction algorithms based on discernibility matrix: The ordered attributes method , 2001, Journal of Computer Science and Technology.

[24]  Wen-Xiu Zhang,et al.  Attribute reduction theory and approach to concept lattice , 2007, Science in China Series F: Information Sciences.

[25]  Zhongzhi Shi,et al.  A fast approach to attribute reduction in incomplete decision systems with tolerance relation-based rough sets , 2009, Inf. Sci..

[26]  Samir Elloumi,et al.  A multi-level conceptual data reduction approach based on the Lukasiewicz implication , 2004, Inf. Sci..

[27]  Bernhard Ganter,et al.  Formal Concept Analysis, 6th International Conference, ICFCA 2008, Montreal, Canada, February 25-28, 2008, Proceedings , 2008, International Conference on Formal Concept Analysis.

[28]  Radim Belohlávek,et al.  A note on variable threshold concept lattices: Threshold-based operators are reducible to classical concept-forming operators , 2007, Inf. Sci..

[29]  Gerd Stumme,et al.  Computing iceberg concept lattices with T , 2002, Data Knowl. Eng..

[30]  Rokia Missaoui,et al.  Formal Concept Analysis for Knowledge Discovery and Data Mining: The New Challenges , 2004, ICFCA.