Abstract
In this paper we discuss Alpha Galois lattices (Alpha lattices for short) and the corresponding association rules. An alpha lattice is coarser than the related concept lattice and so contains fewer nodes, so fewer closed patterns, and a smaller basis of association rules. Coarseness depends on a a priori classification, i.e. a cover \({\mathcal C}\) of the powerset of the instance set I, and on a granularity parameter α. In this paper, we define and experiment a Merge operator that when applied to two Alpha lattices \(G({\mathcal C}_1,\alpha) \) and \(G({\mathcal C}_2,\alpha)\) generates the Alpha lattice \(G({\mathcal C}_1 \cup {\mathcal C}_2,\alpha)\), so leading to a class-incremental construction of Alpha lattices. We then briefly discuss the implementation of the incremental process and describe the min-max bases of association rules extracted from Alpha lattices.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arimura, H.: Efficient algorithms for mining frequent and closed patterns from semi-structured data. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 2–13. Springer, Heidelberg (2008)
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)
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)
Janetzko, D., Cherfi, H., Kennke, R., Napoli, A., Toussaint, Y.: Knowledge-based selection of association rules for text mining. In: de Mántaras, R.L., Saitta, L. (eds.) ECAI, pp. 485–489. IOS Press, Amsterdam (2004)
Liquiere, M., Sallantin, J.: Structural machine learning with Galois lattice and graphs. In: ICML 1998. Morgan Kaufmann, San Francisco (1998)
Pasquier, N., Taouil, R., Bastide, Y., Stumme, G., Lakhal, L.: Generating a condensed representation for association rules. Journal 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)
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)
Termier, A., Rousset, M.-C., Sebag, M., Ohara, K., Washio, T., Motoda, H.: Dryadeparent, an efficient and robust closed attribute tree mining algorithm. IEEE Trans. Knowl. Data Eng. 20(3), 300–320 (2008)
Uno, T., Asai, T., Uchida, Y., Arimura, H.: An efficient algorithm for enumerating closed patterns in transaction databases. Discovery Science, 16–31 (2004)
Valtchev, P., Missaoui, R.: Building concept (Galois) lattices from parts: generalizing the incremental methods. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol. 2120, pp. 290–303. Springer, Heidelberg (2001)
Valtchev, P., Missaoui, R., Lebrun, P.: A partition-based approach towards building Galois (concept) lattices. Discrete Mathematics 256(3), 801–829 (2002)
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., 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)
Zaki, M.J.: Generating non-redundant association rules. In: 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
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Soldano, H., Ventos, V., Champesme, M., Forge, D. (2010). Incremental Construction of Alpha Lattices and Association Rules. In: Setchi, R., Jordanov, I., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based and Intelligent Information and Engineering Systems. KES 2010. Lecture Notes in Computer Science(), vol 6277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15390-7_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-15390-7_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15389-1
Online ISBN: 978-3-642-15390-7
eBook Packages: Computer ScienceComputer Science (R0)