Yet a faster algorithm for building the hasse diagram of a concept lattice

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

Volumn 5548 LNAI, Issue , 2009, Pages 162-177

  Baixeries, Jaume ^a   Szathmary, Laszlo ^a   Valtchev, Petko ^a   Godin, Robert ^a  

^a UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSED PATTERN; CONCEPT LATTICES; DATA MINING PROBLEMS; DATA SETS; FORMAL CONCEPT ANALYSIS; FORMAL FRAMEWORK; HASSE DIAGRAMS; INCREMENTAL APPROACH; NOVEL METHODS; REDUCED REPRESENTATION; TARGET PATTERNS; THEORETICAL COMPLEXITY;

MINERS; MINING;

FORMAL LOGIC;

EID: 67650483711     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01815-2_13     Document Type: Conference Paper

References (18)

1. Ganter, B.: Two basic algorithms in concept analysis (preprint). Technical Report 831, Technische Hochschule, Darmstadt (1984)
2. Bordat, J.-P.: Calcul pratique du treillis de Galois d,une correspondance. Mathématiques et Sciences Humaines 96, 31-47 (1986)
3. Carpineto, C., Romano, G.: Concept Data Analysis: Theory and Applications. John Wiley & Sons, Ltd., Chichester (2004)
4. Ganter, B., Wille, R.: Formal Concept Analysis, Mathematical Foundations. Springer, Heidelberg (1999)
5. Godin, R., Missaoui, R.: An Incremental Concept Formation Approach for Learningfrom Databases. Theoretical Computer Science 133, 378-419 (1994)
6. Kryszkiewicz, M.: Concise Representation of Frequent Patterns Based on Disjunction-Free Generators. In: Proc. of the 2001 IEEE Intl. Conf. on Data Mining (ICDM 2001), Washington, DC, pp. 305-312. IEEE Computer Society Press, Los Alamitos (2001)
7. Martin, B., Eklund, P.W.: From Concepts to Concept Lattice: A Border Algorithm for Making Covers Explicit. In: Medina, R., Obiedkov, S. (eds.) ICFCA 2008. LNCS (LNAI), vol. 4933, pp. 78-89. Springer, Heidelberg (2008)
8. Nourine, L., Raynaud, O.: A fast algorithm for building lattices. Inf. Process. Lett. 71(5-6), 199-204 (1999)
9. Pei, J., Han, J., Mao, R.: CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 21-30 (2000)
10. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering Frequent Closed Itemsets for Association Rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398-416. Springer, Heidelberg (1998)
11. Pfaltz, J.L.: Incremental Transformation of Lattices: A Key to Effective Knowledge Discovery. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol. 2505, pp. 351-362. Springer, Heidelberg (2002)
12. Zaki, M.J., Hsiao, C.-J.: ChARM: An Efficient Algorithm for Closed Itemset Mining. In: SIAM Intl. Conf. on Data Mining (SDM 2002), pp. 33-43 (April 2002)
13. Zaki, M.J., Hsiao, C.-J.: Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure. IEEE Trans. on Knowl. and Data Eng. 17(4), 462-478 (2005)
14. Szathmary, L., Valtchev, P., Napoli, A., Godin, R.: Constructing Iceberg Lattices from Frequent Closures Using Generators. In: Boulicaut, J.-F., Berthold, M.R., Horváth, T. (eds.) DS 2008. LNCS (LNAI), vol. 5255, pp. 136-147. Springer, Heidelberg (2008)
15. Szathmary, L.: Symbolic Data Mining Methods with the Coron Platform. PhD Thesis in Computer Science, Univ. Henri Poincaré - Nancy 1, France (November 2006)
16. Szathmary, L., Valtchev, P., Napoli, A., Godin, R.: AModular Approach for Mining Iceberg Lattices with Generators. In: Proc. of the 9th SIAM Intl. Conf. on Data Mining (SDM 2009) (submitted) (2009)
17. Valtchev, P., Missaoui, R., Lebrun, P.: A Fast Algorithm for Building the Hasse Diagram of a Galois Lattice. In: Proc. of Colloque LaCIM 2000, Montreal, Canada, pp. 293-306 (2000)
18. Valtchev, P., Hacene, M.R., Missaoui, R.: A Generic Scheme for the Design of Efficient On-Line Algorithms for Lattices. In: Ganter, B., de Moor, A., Lex, W. (eds.) ICCS 2003. LNCS, vol. 2746, pp. 282-295. Springer, Heidelberg (2003)