Attribute reduction theory of concept lattice based on decision formal contexts

The theory of concept lattices is an efficient tool for knowledge representation and knowledge discovery, and is applied to many fields successfully. One focus of knowledge discovery is knowledge reduction. Based on the reduction theory of classical formal context, this paper proposes the definition of decision formal context and its reduction theory, which extends the reduction theory of concept lattices. In this paper, strong consistence and weak consistence of decision formal context are defined respectively. For strongly consistent decision formal context, the judgment theorems of consistent sets are examined, and approaches to reduction are given. For weakly consistent decision formal context, implication mapping is defined, and its reduction is studied. Finally, the relation between reducts of weakly consistent decision formal context and reducts of implication mapping is discussed.

[1]  J. Deogun,et al.  Concept approximations based on rough sets and similarity measures , 2001 .

[2]  Yiyu Yao,et al.  Concept lattices in rough set theory , 2004, IEEE Annual Meeting of the Fuzzy Information, 2004. Processing NAFIPS '04..

[3]  Peter A. Grigoriev,et al.  Elements of an Agile Discovery Environment , 2003, Discovery Science.

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

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

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

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

[8]  Thomas W. Reps,et al.  Identifying Modules via Concept Analysis , 1999, IEEE Trans. Software Eng..

[9]  Paolo Tonella,et al.  Using a Concept Lattice of Decomposition Slices for Program Understanding and Impact Analysis , 2003, IEEE Trans. Software Eng..

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

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

[12]  GraphsDan Corbett,et al.  Knowledge Reuse in SEED Exploiting Conceptual , 2007 .

[13]  Oliver Meyer,et al.  Text Schema Mining Using Graphs and Formal Concept Analysis , 2002, ICCS.

[14]  Andrew M. Sutton,et al.  Recovering UML class models from C++: A detailed explanation , 2007, Inf. Softw. Technol..