Abstract
What we propose here is to reduce the size of Galois lattices still conserving their formal structure and exhaustivity. For that purpose we use a preliminary partition of the instance set, representing the association of a “type” to each instance. By redefining the notion of extent of a term in order to cope, to a certain degree (denoted as α), with this partition, we define a particular family of Galois lattices denoted as Alpha Galois lattices. We also discuss the related implication rules defined as inclusion of such α-extents and show that Iceberg concept lattices are Alpha Galois lattices where the partition is reduced to one single class.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barbu, M., Montjardet, M.: Ordre et Classification. Algèbre et Combinatoire 2. Hachette Université (1970)
Birkhoff, G.: Lattice Theory. American Mathematical Society Colloquium Publications, Rhode Island (1973)
Ganascia, J.-G.: TDIS: an algebraic formalization. In: Int. Joint Conf. on Art. Int., vol. 2, pp. 1008–1013 (1993)
Ganter, B., Wille, R.: Formal Concept Analysis: Logical 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)
Hereth, J., Stumme, G., Wille, R., Wille, U.: Conceptual knowledge discovery and data analysis. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS (LNAI), vol. 1867, pp. 421–437. Springer, Heidelberg (2000)
Kuznetsov, S., Obiedkov, S.: Comparing performance of algorithms for generating concept lattices. J. of Experimental and Theoretical Art. Int. 2/3(14), 189–216 (2002)
Liquiere, M., Sallantin, J.: Structural machine learning with Galois lattice and graphs. In: ICML 1998. Morgan Kaufmann, San Francisco (1998)
Luxenburger, M.: Implications partielles dans un contexte. Mathématiques, Informatique et Sciences Humaines 29(113), 35–55 (1991)
Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Information Systems 24(1), 25–46 (1999)
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)
Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Intelligent structuring and reducing of association rules with formal concept analysis. In: Baader, F., Brewka, G., Eiter, T. (eds.) KI 2001. LNCS (LNAI), vol. 2174, pp. 335–349. Springer, Heidelberg (2001)
Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with titanic. Data and Knowledge Engineering 42(2), 189–222 (2002)
Valtchev, P., Missaoui, R., Lebrun, P.: A partition-based approach towards building Galois (concept) lattices. Discrete Mathematics 256(3), 801–829 (2002)
Ventos, V., Soldano, H.: Les treillis de Galois alpha ou De l?influence d?une partition a priori des donneés. Revue d’Intelligence Artificielle (2005) (to appear)
Waiyamai, K., Lakhal, L.: Knowledge discovery from very large databases using frequent concept lattices. In: Lopez de Mantaras, R., Plaza, E. (eds.) ECML 2000. LNCS (LNAI), vol. 1810, pp. 437–445. Springer, Heidelberg (2000)
Zaki, M.J.: Generating non-redundant association rules. Intl. Conf. on Knowledge Discovery and DataMining, KDD 2000 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ventos, V., Soldano, H. (2005). Alpha Galois Lattices: An Overview. In: Ganter, B., Godin, R. (eds) Formal Concept Analysis. ICFCA 2005. Lecture Notes in Computer Science(), vol 3403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32262-7_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-32262-7_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24525-4
Online ISBN: 978-3-540-32262-7
eBook Packages: Computer ScienceComputer Science (R0)