Constructing iceberg lattices from frequent closures using generators

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

Volumn 5255 LNAI, Issue , 2008, Pages 136-147

  Szathmary, Laszlo ^a   Valtchev, Petko ^a   Napoli, Amedeo ^b   Godin, Robert ^a  

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

^b LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; SEA ICE;

COMPUTATION ALGORITHM; CONCEPT ANALYSIS; FUNDAMENTAL PROPERTIES; GENERICITY; HYPERGRAPH THEORY; PRECEDENCE RELATIONS; SCALABLE ALGORITHMS;

COMPUTATIONAL EFFICIENCY;

EID: 56749177366     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88411-8_15     Document Type: Conference Paper

References (19)

1. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: Proc. of the 20th Intl. Conf. on Very Large Data Bases (VLDB 1994), pp. 487-499. Morgan Kaufmann Publishers Inc., San Francisco (1994)
2. Kryszkiewicz, M.: Concise Representations of Association Rules. In: Proc. of the ESF Exploratory Workshop on Pattern Detection and Discovery, pp. 92-109 (2002)
3. 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)
4. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering Frequent Closed Item-sets for Association Rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398-416. Springer, Heidelberg (1998)
5. Zaki, M.J., Hsiao, C.J.: Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure. IEEE Transactions on Knowledge and Data Engineering 17(4), 402-478 (2005)
6. Carpineto, C., Romano, G.: Concept Data Analysis: Theory and Applications. John Wiley & Sons, Ltd., Chichester (2004)
7. 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)
8. Nehme, K., Valtchev, P., Rouane, M.H., Godin, R.: On Computing the Minimal Generator Family for Concept Lattices and Icebergs. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol. 3403, pp. 192-207. Springer, Heidelberg (2005)
9. Nourine, L., Raynaud, O.: A fast algorithm for building lattices. Inf. Process. Lett. 71(5-6), 199-204 (1999)
10. Eiter, T., Gottlob, G.: Identifying the Minimal Transversals of a Hypergraph and Related Problems. SIAM Journal on Computing 24(6), 1278-1304 (1995)
11. Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining frequent patterns with counting inference. SIGKDD Explor. Newsl. 2(2), 66-75 (2000)
12. Ganter, B., Wille, R.: Formal concept analysis: mathematical foundations, p. 284. Springer, Heidelberg (1999)
13. Calders, T., Rigotti, C., Boulicaut, J.F.: A Survey on Condensed Representations for Frequent Sets. In: Boulicaut, J.-F., De Raedt, L., Mannila, H. (eds.) Constraint-Based Mining and Inductive Databases. LNCS (LNAI), vol. 3848, pp. 64-80. Springer, Heidelberg (2006)
14. Pasquier, N.: Mining association rules using formal concept analysis. In: Proc. of the 8th Intl. Conf. on Conceptual Structures (ICCS 2000), August 2000, pp. 259-264. Shaker-Verlag (2000)
15. Pfaltz, J.L., Taylor, CM.: Scientific Knowledge Discovery through Iterative Transformation of Concept Lattices. In: Proc. of the Workshop on Discrete Applied Mathematics in conjunction with the 2nd SIAM Intl. Conf. on Data Mining, Arlington, VA, USA, pp. 65-74 (2002)
16. Berge, C.: Hypergraphs: Combinatorics of Finite Sets. North Holland, Amsterdam (1989)
17. Szathmary, L., Napoli, A., Kuznetsov, S.O.: ZART: A Multifunctional Itemset Mining Algorithm. In: Proc. of the 5th Intl. Conf. on Concept Lattices and Their Applications (CLA 2007), Montpellier, France, October 2007, pp. 26-37 (2007)
18. Szathmary, L., Valtchev, P., Napoli, A., Godin, R.: An Efficient Hybrid Algorithm for Mining Frequent Closures and Generators. In: Proc. of the 6th Intl. Conf. on Concept Lattices and Their Applications (CLA 2008), Olomouc, Czech Republic (accepted, 2008)
19. Szathmary, L.: Symbolic Data Mining Methods with the Coron Platform. PhD Thesis in Computer Science, Univ. Henri Poincaré - Nancy 1, France (November 2006)