Incremental construction of alpha lattices and association rules

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6277 LNAI, Issue PART 2, 2010, Pages 351-360

  Soldano, Henry ^a   Ventos, Véronique ^b   Champesme, Marc ^a   Forge, David ^b  

^a UNIVERSITÉ PARIS 13   (France)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

[No Author keywords available]

Indexed keywords

KNOWLEDGE BASED SYSTEMS;

ALPHA GALOIS LATTICES; CLOSED PATTERN; CONCEPT LATTICES; INCREMENTAL CONSTRUCTION; INCREMENTAL PROCESS; MERGE OPERATORS; MIN-MAX;

ASSOCIATION RULES;

EID: 78449234573     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15390-7_36     Document Type: Conference Paper

References (17)

1. 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)
2. Barbu, M., Montjardet, M.: Ordre et Classification, Algèbre et Combinatoire 2. Hachette Université (1970)
3. Birkhoff, G.: Lattice Theory. American Mathematical Society Colloquium Publications, Rhode Island (1973)
4. Ganter, B., Wille, R.: Formal Concept Analysis: Logical Foundations. Springer, Heidelberg (1999)
5. 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)
6. 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)
7. Liquiere, M., Sallantin, J.: Structural machine learning with Galois lattice and graphs. In: ICML 1998. Morgan Kaufmann, San Francisco (1998)
8. 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)
9. 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)
10. 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)
11. 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)
12. Uno, T., Asai, T., Uchida, Y., Arimura, H.: An efficient algorithm for enumerating closed patterns in transaction databases. Discovery Science, 16-31 (2004)
13. 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)
14. Valtchev, P., Missaoui, R., Lebrun, P.: A partition-based approach towards building Galois (concept) lattices. Discrete Mathematics 256(3), 801-829 (2002)
15. 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)
16. 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)
17. Zaki, M.J.: Generating non-redundant association rules. In: Intl. Conf. on Knowledge Discovery and DataMining, KDD 2000 (2000)