Abstract Concept Lattices

We present a view of abstraction based on a structure preserving reduction of the Galois connection between a language L of terms and the powerset of a set of instances O. Such a relation is materialized as an extension-intension lattice, namely a concept lattice when L is the powerset of a set P of attributes. We define and characterize an abstraction A as some part of either the language or the powerset of O, defined in such a way that the extension-intension latticial structure is preserved. Such a structure is denoted for short as an abstract lattice. We discuss the extensional abstract lattices obtained by so reducing the powerset of O, together together with the corresponding abstract implications, and discuss alpha lattices as particular abstract lattices. Finally we give formal framework allowing to define a generalized abstract lattice whose language is made of terms mixing abstract and non abstract conjunctions of properties.

[1]  Brian F. Chellas.  Modal Logic: Normal systems of modal logic , 1980 .

[2]  Vincent Duquenne,et al.  Familles minimales d'implications informatives résultant d'un tableau de données binaires , 1986 .

[3]  B. Bollobás.  Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability , 1986 .

[4]  Frank J. Oles,et al.  The Equivalence of Model-Theoretic and Structural Subsumption in Description Logics , 1993, IJCAI.

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

[6]  Jean-Gabriel Ganascia.  TDIS : an Algebraic Formalization , 1993, IJCAI.

[7]  Véronique Ventos.  A Deductive Study of the C-CLASSICde Description Logic , 1996, Description Logics.

[8]  Yiyu Yao,et al.  Generalization of Rough Sets using Modal Logics , 1996, Intell. Autom. Soft Comput..

[9]  Jean Sallantin,et al.  Structural Machine Learning with Galois Lattice and Graphs , 1998, ICML.

[10]  Henry Soldano,et al.  Tabata: A Learning Algorithm Performing a Bidirectional Search in a Reduced Search Space Using a Tabu Strategy , 1998, ECAI.

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

[12]  Bernhard Ganter,et al.  Conceptual Structures: Logical, Linguistic, and Computational Issues , 2000, Lecture Notes in Computer Science.

[13]  Laurent Chaudron,et al.  Generalized Formal Concept Analysis , 2000, ICCS.

[14]  Rachel Ben-Eliyahu-Zohary,et al.  A modal logic for subjective default reasoning , 2000, Artif. Intell..

[15]  Jean-Daniel Zucker,et al.  A model of abstraction in visual perception , 2001, Appl. Artif. Intell..

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

[17]  Gerd Stumme,et al.  Conceptual Structures: Broadening the Base , 2001, Lecture Notes in Computer Science.

[18]  Nathalie Pernelle,et al.  ZooM: a nested Galois lattices-based system for conceptual clustering , 2002, J. Exp. Theor. Artif. Intell..

[19]  Rokia Missaoui,et al.  Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory , 2002, J. Exp. Theor. Artif. Intell..

[20]  Edwin Diday,et al.  Maximal and Stochastic Galois Lattices , 2003, Discret. Appl. Math..

[21]  Petko Valtchev,et al.  Galicia : an open platform for lattices , 2003 .

[22]  Bernard Monjardet,et al.  The Lattices of Closure Systems, Closure Operators, and Implicational Systems on a Finite Set: A Survey , 2003, Discret. Appl. Math..

[23]  Lakhmi C. Jain,et al.  Knowledge-Based Intelligent Information and Engineering Systems , 2004, Lecture Notes in Computer Science.

[24]  O. Ridoux,et al.  Introduction to logical information systems , 2004, Inf. Process. Manag..

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

[26]  Henry Soldano,et al.  Alpha Galois Lattices: An Overview , 2005, ICFCA.

[27]  Gerd Stumme,et al.  Generating a Condensed Representation for Association Rules , 2005, Journal of Intelligent Information Systems.

[28]  Greg Restall.  Logic: An Introduction , 2005 .

[29]  Sébastien Ferré,et al.  Negation, Opposition, and Possibility in Logical Concept Analysis , 2006, ICFCA.

[30]  Bijan Davvaz,et al.  Rough approximations in a general approximation space and their fundamental properties , 2008, Int. J. Gen. Syst..

[31]  Gianpiero Cattaneo,et al.  Lattices with Interior and Closure Operators and Abstract Approximation Spaces , 2009, Trans. Rough Sets.

[32]  David Forge,et al.  Incremental Construction of Alpha Lattices and Association Rules , 2010, KES.

[33]  Henry Soldano.  A Modal View on Abstract Learning and Reasoning , 2011, SARA.

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