Knowledge reduction in formal decision contexts based on an order-preserving mapping

Knowledge reduction is one of the basic issues in knowledge presentation and data mining. In this study, an order-preserving mapping between the set of all the extensions of the conditional concept lattice and that of the decision concept lattice is defined to classify formal decision contexts into consistent and inconsistent categories. Then, methods of knowledge reduction for both the consistent and the inconsistent formal decision contexts are formulated by constructing proper discernibility matrices and their associated Boolean functions. For the consistent formal decision contexts, the proposed reduction method can avoid redundancy subject to maintaining consistency, while for the inconsistent formal decision contexts, the reduction method can make the set of all the compact non-redundant decision rules complete in the initial formal decision context.

[1]  Gerd Stumme,et al.  Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets , 2000, Computational Logic.

[2]  Bernard De Baets,et al.  Inducing decision trees via concept lattices , 2009, CLA.

[3]  Mohammed J. Zaki.  Mining Non-Redundant Association Rules , 2004, Data Min. Knowl. Discov..

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

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

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

[7]  Claudio Carpineto,et al.  A lattice conceptual clustering system and its application to browsing retrieval , 2004, Machine Learning.

[8]  Jean-François Boulicaut,et al.  Approximation of Frequency Queris by Means of Free-Sets , 2000, PKDD.

[9]  Gerd Stumme,et al.  Document retrieval for e-mail search and discovery using formal concept analysis , 2003, Appl. Artif. Intell..

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

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

[12]  Andrzej Skowron,et al.  Boolean Reasoning for Decision Rules Generation , 1993, ISMIS.

[13]  L. Beran,et al.  [Formal concept analysis]. , 1996, Casopis lekaru ceskych.

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

[15]  Jean-François Boulicaut,et al.  A Survey on Condensed Representations for Frequent Sets , 2004, Constraint-Based Mining and Inductive Databases.

[16]  Claudio Carpineto,et al.  Exploiting the Potential of Concept Lattices for Information Retrieval with CREDO , 2004, J. Univers. Comput. Sci..

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

[18]  Engelbert Mephu Nguifo,et al.  Succinct Minimal Generators: Theoretical Foundations and Applications , 2008, Int. J. Found. Comput. Sci..

[19]  Andrzej Skowron,et al.  The Discernibility Matrices and Functions in Information Systems , 1992, Intelligent Decision Support.

[20]  Jinhai Li,et al.  A heuristic knowledge-reduction method for decision formal contexts , 2011, Comput. Math. Appl..

[21]  Xindong Wu.  EIC Editorial: Introducing the New Editor-in-Chief and Four New Associate Editors , 2009, IEEE Trans. Knowl. Data Eng..

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

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

[24]  Jean-François Boulicaut,et al.  Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries , 2004, Data Mining and Knowledge Discovery.

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

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

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

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

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

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

[31]  Xia Wang,et al.  Relations of attribute reduction between object and property oriented concept lattices , 2008, Knowl. Based Syst..

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

[33]  Marianne Huchard,et al.  Formal concept analysis-based service classification to dynamically build efficient software component directories , 2009, Int. J. Gen. Syst..