Abstract
We present a view of abstraction based on a structure preserving reduction of the Galois connection between a language \(\cal 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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ben-David, S., Ben-Eliyahu-Zohary, R.: A modal logic for subjective default reasoning. Artif. Intell. 116(1-2), 217–236 (2000)
Bollobás, B.: Combinatorics: set systems, hypergraphs, families of vectors, and combinatorial probability. Cambridge University Press, New York (1986)
Brézellec, P., Soldano, H.: Tabata: a learning algorithm performing a bidirectional search in a reduced search space using a tabu stratégie. In: Eur. Conf. in Art. Int., ECAI 1998, Brighton, England, pp. 420–424. Wiley and Sons, Chichester (1998)
Caspard, N., Monjardet, B.: The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey. Discrete Appl. Math. 127(2), 241–269 (2003)
Cattaneo, G., Ciucci, D.: Lattices with interior and closure operators and abstract approximation spaces. T. Rough Sets 10, 67–116 (2009)
Chaudron, L., Maille, N.: Generalized formal concept analysis. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS, vol. 1867, pp. 357–370. Springer, Heidelberg (2000)
Chellas, B.F.: Modal Logic: an introduction. Cambridge University Press, Cambridge (1980)
Davvaz, B., Mahdavipour, M.: Rough approximations in a general approximation space and their fundamental properties. International Journal of General Systems 37(3), 373–386 (2008)
Diday, E., Emilion, R.: Maximal and stochastic galois lattices. Discrete Appl. Math. 127(2), 271–284 (2003)
Dionne, R., Mays, E., Oles, F.J.: The equivalence of model-theoretic and structural subsumption in description logics. In: Int. Joint Conf. on Art. Int. (IJCAI), pp. 710–717 (1993)
Erné, M., Koslowski, J., Melton, A., Strecker, G.E.: A Primer on Galois Connections. Annals of the New York Academy of Sciences 704(Papers on General Topology and Applications), 103–125 (1993)
Ferré, S.: Negation, opposition, and possibility in logical concept analysis. In: Missaoui, R., Schmidt, J. (eds.) ICFCA 2006. LNCS (LNAI), vol. 3874, pp. 130–145. Springer, Heidelberg (2006)
Ferré, S., Ridoux, O.: An introduction to logical information systems. Information Processing and Management 40(3), 383–419 (2004)
Ganascia, J.-G.: TDIS: an algebraic formalization. In: Int. Joint Conf. on Art. Int (IJCAI), vol. 2, pp. 1008–1013 (1993)
Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)
Ganter, B., Kuznetsov, S.O.: Pattern structures and their projections. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol. 2120, pp. 129–142. Springer, Heidelberg (2001)
Guigues, J.L., Duquenne, V.: Famille non redondante d’implications informatives résultant d’un tableau de données binaires. Mathématiques et Sciences Humaines 95, 5–18 (1986)
Liquière, M., Sallantin, J.: Structural machine learning with Galois Lattice and Graphs. In: ECML 1998, pp. 305–313. Morgan Kaufmann Publishers Inc., San Francisco (1998)
Pasquier, N., Taouil, R., Bastide, Y., Stumme, G., Lakhal, L.: Generating a condensed representation for association rules. Journal of Intelligent Information Systems (JIIS) 24(1), 29–60 (2005)
Pernelle, N., Rousset, M.-C., Soldano, H., Ventos, V.: Zoom: a nested Galois lattices-based system for conceptual clustering. J. of Experimental and Theoretical Artificial Intelligence 2/3(14), 157–187 (2002)
Saitta, L., Zucker, J.-D.: A model of abstraction in visual perception. Applied Artificial Intelligence 15(8), 761–776 (2001)
Soldano, H.: A modal view on abstract learning and reasoning. Technical report, L.I.P.N, UMR-CNRS 7030, Université Paris-Nord (2010)
Soldano, H., Ventos, V., Champesme, M., Forge, D.: Incremental construction of alpha lattices and association rules. In: Setchi, R., Jordanov, I., Howlett, R.J., Jain, L.C. (eds.) KES 2010. LNCS, vol. 6277, pp. 351–360. Springer, Heidelberg (2010)
Valtchev, P., Grosser, D., Roume, C., Hacene, M.R.: Galicia: An open platform for lattices. In: In Using Conceptual Structures: Contributions to the 11th Intl. Conference on Conceptual Structures (ICCS 2003), pp. 241–254. Shaker Verlag (2003)
Valtchev, P., Missaoui, R., Godin, R.: Formal concept analysis for knowledge discovery and data mining: The new challenges. In: Eklund, P.W. (ed.) ICFCA 2004. LNCS (LNAI), vol. 2961, pp. 352–371. Springer, Heidelberg (2004)
Valtchev, P., Missaoui, R., Godin, R., Meridji, M.: Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory. J. of Experimental and Theoretical Artificial Intelligence 2/3(14), 115–142 (2002)
Ventos, V.: A deductive study of the c-classicde description logic. In: Description Logics. AAAI Technical Report, vol. WS-96-05, pp. 192–196. AAAI Press, Menlo Park (1996)
Ventos, V., Soldano, H.: Alpha Galois Lattices: An Overview. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol. 3403, pp. 299–314. Springer, Heidelberg (2005)
Yao, Y.Y., Lin, T.Y.: Generalization of rough sets using modal logics. Intelligent Automation and Soft Computing 2, 103–120 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Soldano, H., Ventos, V. (2011). Abstract Concept Lattices. In: Valtchev, P., Jäschke, R. (eds) Formal Concept Analysis. ICFCA 2011. Lecture Notes in Computer Science(), vol 6628. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20514-9_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-20514-9_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20513-2
Online ISBN: 978-3-642-20514-9
eBook Packages: Computer ScienceComputer Science (R0)