Rough-set concept analysis: Interpreting RS-definable concepts based on ideas from formal concept analysis

Based on ideas from formal concept analysis, this paper interprets the notions of RS-definable concepts (i.e., rough-set definable concepts) and the Boolean algebra of RS-definable concepts. We explicitly represent a RS-definable concept as a pair of an extension and an intension, where the extension is a set of objects and the intension is a family of sets of attribute-value pairs called avp-sets. An object in the extension satisfies at least one avp-set in the intension and each avp-set in the intension is satisfied by only objects in the extension. The two-directional connections produce an atomic Boolean algebra of RS-definable concepts, corresponding to the lattice of formal concepts in formal concept analysis. The Boolean algebra of RS-definable concepts is used to define and interpret a subset of objects through a pair of lower and upper approximations. The new formulation emphasizes on an in-depth conceptual understanding of rough-set concept analysis.

[1]  Edward E. Smith,et al.  Concepts and concept formation. , 1984, Annual review of psychology.

[2]  Ivo Düntsch,et al.  Modal-style operators in qualitative data analysis , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[3]  Lukasz A. Kurgan,et al.  Machine Learning Algorithms Inspired by the Work of Ryszard Spencer Michalski , 2010, Advances in Machine Learning I.

[4]  Rudolf Wille.  Preconcept Algebras and Generalized Double Boolean Algebras , 2004, ICFCA.

[5]  Ivo Düntsch,et al.  Approximation Operators in Qualitative Data Analysis , 2003, Theory and Applications of Relational Structures as Knowledge Instruments.

[6]  Bernhard Ganter,et al.  Pattern Structures and Their Projections , 2001, ICCS.

[7]  Sergei O. Kuznetsov,et al.  On stability of a formal concept , 2007, Annals of Mathematics and Artificial Intelligence.

[8]  Antoine Arnauld,et al.  Logic or the Art of Thinking: Cambridge texts in the history of philosophy , 1996 .

[9]  Yee Leung,et al.  Dependence-space-based attribute reduction in consistent decision tables , 2011, Soft Comput..

[10]  Ling Wei,et al.  A Partitional View of Concept Lattice , 2005, RSFDGrC.

[11]  Xiangping Kang,et al.  Rough set model based on formal concept analysis , 2013, Inf. Sci..

[12]  Ming-Wen Shao,et al.  Approximation in Formal Concept Analysis , 2005, RSFDGrC.

[13]  Olivier Ridoux,et al.  A Logical Generalization of Formal Concept Analysis , 2000, ICCS.

[14]  Didier Dubois,et al.  Possibility theory and formal concept analysis: Characterizing independent sub-contexts , 2012, Fuzzy Sets Syst..

[15]  Bernhard Ganter,et al.  Scale Coarsening as Feature Selection , 2008, ICFCA.

[16]  Jesús Medina,et al.  Multi-adjoint property-oriented and object-oriented concept lattices , 2012, Inf. Sci..

[17]  Marcin Wolski.  Galois Connections and Data Analysis , 2004, Fundam. Informaticae.

[18]  Rudolf Wille,et al.  The Basic Theorem on Preconcept Lattices , 2006, ICFCA.

[19]  Arthur P. Dempster,et al.  Upper and Lower Probabilities Induced by a Multivalued Mapping , 1967, Classic Works of the Dempster-Shafer Theory of Belief Functions.

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

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

[22]  Maokang Luo,et al.  Rough concept lattices and domains , 2009, Ann. Pure Appl. Log..

[23]  Z. Pawlak.  Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[24]  Marcel Erné,et al.  A Primer on Galois Connections , 1993 .

[25]  Cungen Cao,et al.  Formal Concept Analysis in Relational Database and Rough Relational Database , 2007, Fundam. Informaticae.

[26]  Karl Erich Wolff,et al.  A Conceptual View of Knowledge Bases in Rough Set Theory , 2000, Rough Sets and Current Trends in Computing.

[27]  Ju Wang,et al.  Concept Approximation in Concept Lattice , 2001, PAKDD.

[28]  Yiyu Yao,et al.  Interval Structure: A Framework for Representing Uncertain Information , 1992, UAI.

[29]  Yiyu Yao,et al.  A Note on Definability and Approximations , 2007, Trans. Rough Sets.

[30]  Ling Wei,et al.  Granular Reduction of Property-Oriented Concept Lattices , 2010, ICCS.

[31]  Jerzy W. Grzymala-Busse,et al.  A New Version of the Rule Induction System LERS , 1997, Fundam. Informaticae.

[32]  Victor W. Marek,et al.  Information Storage and Retrieval Systems: Mathematical Foundations , 1976, Theor. Comput. Sci..

[33]  Yiyu Yao,et al.  Rough set approximations in formal concept analysis , 2004, IEEE Annual Meeting of the Fuzzy Information, 2004. Processing NAFIPS '04..

[34]  Bernhard Ganter,et al.  A Formal Concept Analysis Approach to Rough Data Tables , 2011, Trans. Rough Sets.

[35]  Susanne Prediger,et al.  Logical Scaling in Formal Concept Analysis , 1997, ICCS.

[36]  Guilong Liu,et al.  Rough set theory based on two universal sets and its applications , 2010, Knowl. Based Syst..

[37]  Didier Dubois,et al.  The Structure of Oppositions in Rough Set Theory and Formal Concept Analysis - Toward a New Bridge between the Two Settings , 2014, FoIKS.

[38]  Yee Leung,et al.  Attribute reductions in object-oriented concept lattices , 2014, Int. J. Mach. Learn. Cybern..

[39]  Jerzy W. Grzymala-Busse,et al.  LERS-A System for Learning from Examples Based on Rough Sets , 1992, Intelligent Decision Support.

[40]  Yiyu Yao,et al.  A Definition of Structured Rough Set Approximations , 2014, RSEISP.

[41]  Zongben Xu,et al.  Rough Set Models on Two universes , 2004, Int. J. Gen. Syst..

[42]  Yiyu Yao,et al.  ON MODELING UNCERTAINTY WITH INTERVAL STRUCTURES , 1995, Comput. Intell..

[43]  Mihir K. Chakraborty,et al.  Formal Topology and Information Systems , 2007, Trans. Rough Sets.

[44]  Jonas Poelmans,et al.  Fuzzy and rough formal concept analysis: a survey , 2014, Int. J. Gen. Syst..

[45]  Yiyu Yao,et al.  The two sides of the theory of rough sets , 2015, Knowl. Based Syst..

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

[47]  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.

[48]  Didier Dubois,et al.  A Possibility-Theoretic View of Formal Concept Analysis , 2007, Fundam. Informaticae.

[49]  Ryszard S. Michalski,et al.  Categories and Concepts: Theoretical Views and Inductive Data Analysis , 1993 .

[50]  Nada Lavrac,et al.  The Multi-Purpose Incremental Learning System AQ15 and Its Testing Application to Three Medical Domains , 1986, AAAI.

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

[52]  Jerzy W. Grzymala-Busse,et al.  Rough Sets , 1995, Commun. ACM.

[53]  Radim Belohlávek,et al.  Concept lattices and order in fuzzy logic , 2004, Ann. Pure Appl. Log..

[54]  Lingyun Yang,et al.  On Rough Concept Lattices , 2010, ISDT.

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

[56]  Rudolf Wille,et al.  Boolean Concept Logic , 2000, ICCS.

[57]  Marcin Wolski.  Formal Concept Analysis and Rough Set Theory from the Perspective of Finite Topological Approximations , 2005, Trans. Rough Sets.

[58]  Zdzisław Pawlak.  Rough concept analysis , 1985 .

[59]  Yiyu Yao,et al.  A multiview approach for intelligent data analysis based on data operators , 2008, Inf. Sci..

[60]  Peter Luksch,et al.  A Mathematical Model for Conceptual Knowledge Systems , 1991 .