Efficient vertical mining of frequent closures and generators

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

Volumn 5772 LCNS, Issue , 2009, Pages 393-404

  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

BREADTH-FIRST TRAVERSAL; DEPTH FIRST; ITEM SETS; POST PROCESSING;

ALGORITHMS; ASSOCIATIVE PROCESSING; COMPETITION;

COMPUTATIONAL EFFICIENCY;

EID: 70349884214     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03915-7_34     Document Type: Conference Paper

References (22)

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, San Francisco (1994
2. Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining Minimal Nonredundant Association Rules Using Frequent Closed Itemsets. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.1861, pp. 972-986. Springer, Heidelberg (2000
3. Kryszkiewicz, M.: Representative Association Rules. In:Wu, X., Kotagiri, R., Korb, K.B. (eds.) PAKDD 1998. LNCS, vol.1394, pp. 198-209. Springer, Heidelberg (1998
4. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Closed Set Based Discovery of Small Covers for Association Rules. In: Proc. 15emes Journees Bases de Donnees Avancees (BDA), pp. 361-381 (1999
5. Duquenne, V.: Contextual Implications Between Attributes and Some Representational Properties for Finite Lattices. In: Beitraege zur Begri.sanalyse, B.I. Wissenschaftsverlag, Mannheim, pp. 213-239 (1987
6. Luxenburger, M.: Implications partielles dans un contexte. Mathématiques, Informatique et Sciences Humaines 113, 35-55 (1991
7. Kryszkiewicz, M.: Concise Representations of Association Rules. In: Proc. of the ESF Exploratory Workshop on Pattern Detection and Discovery, pp. 92-109 (2002
8. 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
9. 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
10. Valtchev, P., Missaoui, R., Godin, R.: Formal Concept Analysis for Knowledge Discovery and Data Mining: The New Challenges. In: Proc. of the 2nd Intl. Conf. on Formal Concept Analysis, pp. 352-371. Springer, Heidelberg (2004
11. 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), pp. 26-37 (2007
12. Zaki, M.J., Hsiao, C.J.: ChARM: An effcient Algorithm for Closed Itemset Mining. In: SIAM Intl. Conf. on Data Mining (SDM 2002), pp. 33-43 (2002
13. Pei, J., Han, J., Mao, R.: CLOSET: An effcient Algorithm for Mining Frequent Closed Itemsets. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 21-30 (2000
14. Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining Frequent Patterns with Counting Inference. SIGKDD Explor. Newsl. 2(2), 66-75 (2000
15. Boulicaut, J.F., Bykowski, A., Rigotti, C.: Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries. Data Mining and Knowledge Discovery 7(1), 5-22 (2003
16. Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New Algorithms for Fast Discovery of Association Rules. In: Proc. of the 3rd Intl. Conf. on Knowledge Discovery in Databases, pp. 283-286 (1997
17. Zaki, M.J.: Scalable Algorithms for Association Mining. IEEE Transactions on Knowledge and Data Engineering 12(3), 372-390 (2000
18. Szathmary, L., Valtchev, P., Napoli, A.: Eficient Mining of Frequent Closures with Precedence Links and Associated Generators. Research Report RR-6657, INRIA (2008), http://hal.inria.fr/inria-00322798/en
19. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999
20. Calders, T., Goethals, B.: Depth-First Non-Derivable Itemset Mining. In: Proc. of the SIAM Intl. Conf. on Data Mining (SDM 2005), Newport Beach, USA (2005
21. Szathmary, L.: Symbolic Data Mining Methods with the Coron Platform. PhD Thesis in Computer Science, Univ. Henri Poincaré - Nancy 1, France (2006
22. 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