Efficient closed pattern mining in strongly accessible set systems (extended abstract)

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

Volumn 4702 LNAI, Issue , 2007, Pages 382-389

  Boley, Mario ^a   Horváth, Tamás ^a   Poigné, Axel ^a   Wrobel, Stefan ^a,b  

^a FRAUNHOFER IAIS   (Germany)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; GRAPH THEORY; MATHEMATICAL OPERATORS; POLYNOMIALS; PROBLEM SOLVING;

CLOSURE OPERATORS; INDEPENDENCE SYSTEMS; POLYNOMIAL DELAY; TRACK MINING;

DATA MINING;

EID: 38049162234     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74976-9_37     Document Type: Conference Paper

References (7)

1. Boros, E., Gurvich, V., Khachiyan, L., Makino, K.: On maximal frequent and minimal infrequent sets in binary matrices. Annals of Mathematics and Artificial Intelligence 39(3), 211-221 (2003)
2. Ganter, B., Reuter, K.: Finding all closed sets: A general approach. Order 8(3), 280-283 (1991)
3. Habib, M., Medina, R., Nourine, L., Steiner, G.: Efficient algorithms on distributive lattices. Discrete Applied Mathematics 110(2-3), 169-187 (2001)
4. Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Information Processing Letters 27(3), 119-123 (1988)
5. Kuijpers, B., Nanni, M., Körner, C., May, M., Pedreschi, D.: Spatio-temporal data mining. In: F. Giannotti and D. Pedreschi, editors, Geography, mobility, and privacy: a knowledge discovery vision (to appear)
6. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Information Systems 24(1), 25-46 (1999)
7. Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concept. In: Rival, I. (ed.) Ordered Sets, pp. 445-470. Reidel, Dordecht/Boston (1982)