A thorough experimental study of datasets for frequent itemsets

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2005, Pages 162-169

  Flouvat, Frédéric ^a   De Marchi, Fabien ^b,c   Petit, Jean Marc ^b,d  

^a UNIVERSITÉ BLAISE PASCAL   (France)

^b CNRS   (France)

^c UNIVERSITÉ LYON 1   (France)

^d UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; DATA STRUCTURES; PATTERN MATCHING;

DATASETS; ITEMSETS;

DATA MINING;

EID: 34548570543     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2005.15     Document Type: Conference Paper

References (38)

1. Synthetic data generation code for associations and sequential patterns. Intelligent information systems, IBM almaden research center. http://www.almaden.ibm.com/software/quest/resources/.
2. R. Agrawal, T. Imielinski, and A. N. Swami. Mining association rules between sets of items in large databases. In P. Buneman and S. Jajodia, editors, SIGMOD conference, Washington, pages 207-216. ACM Press, 1993.
3. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In J. B. Bocca, M. Jarke, and C. Zaniolo, editors, VLDB conference, Santiago de Chile, Chile, pages 487-499. Morgan Kaufmann, 1994.
4. Y. Bastide, R. Taouil, N. Pasquier, O. Stumme, and L. Lakhai. Mining frequent patterns with counting inference. In SIGKDD Explorations 2(2), pages 66-75, 2000.
5. R. J. Bayardo, B. Goethals, and M. J. Zaki, editors. FIMI '04, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, volume 126 of CEUR Workshop Proceedings. CEUR-WS.org, 2004.
6. C. Beeri and M. Vardi. A proof procedure for data dependencies. Journal of the ACM, 31(4):718-741, 1984.
7. C. Borgelt. Efficient implementations of Apriori and Eclat. In FIMI '03, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, November 2003.
8. J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Free-sets: A condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery, 7(1):5-22, 2003.
9. D. Burdick, M. Caliralim, J. Flannick, J. Gehrke, and T. Yiu. MAFIA: A performance study of mining maximal frequent itemsets. In FIMI '03, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, 2003.
10. D. Burdick. M. Calimlim, and J. Gehrke. MAFIA: A maximal frequent itemset algorithm for transactional databases. In ICDE conference, Heidelberg, Germany, pages 443-452. IEEE CS, 2001.
11. A. Bykowski and C. Rigotti. A condensed representation to find frequent patterns. In PODS'01, Santa Barbara, California, USA. ACM, 2001.
12. T. Calders and B. Goethals. Minimal k -free representations of frequent sets. In PKDD, pages 71-82, 2003.
13. A. Casali, R. Cicchetti, and L. Lakhal. Essential patterns: A perfect cover of frequent patterns. In DaWaK conference, Copenhagen, Denmark, Lecture Notes in Computer Science, 2005.
14. M. Casanova, R. Fagin, and C. Papadimitriou. Inclusion dependencies and their interaction with functional dependencies. Journal of Computer and System Sciences, 24(1):29-59, 1984.
15. F. De Marchi and J.-M. Petit. Zigzag : a new algorithm for discovering large inclusion dependencies in relational databases. In ICDM conference, Melbourne, USA, pages 27-34. IEEE Computer Society, 2003.
16. F. Flouvat. Experimental study of frequent itemsets datasets. Technical report, LIMOS, France, http://www.isima.fr/flouvat/papers/rr05-ExpStudyDatasets. pdf, June 2005.
17. F. Flouvat, F. De Marchi. and J.-M. Petit. ABS: Adaptive borders search of frequent itemsets. In FIMI '04, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations.
18. B. Goethals. Frequent itemset mining implementations repository, http://fimi.cs.helsinki.fi/, 2004.
19. B. Goethals and M. J. Zaki. editors. FIMI '03, Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations, 19 December 2003, Melbourne, Florida, USA, volume 90 of CEUR Workshop Proceedings. CEUR-WS.org, 2003.
20. K. Gouda and M. J. Zaki. Efficiently mining maximal frequent itemsets. In N. Cereone, T. Y. Lin, and X. Wu, editors, ICDM conference, San Jose, USA, pages 163-170. IEEE Computer Society, 2001.
21. G. Grahne and J. Zhu. Efficiently using prefix-trees in mining frequent itemsets. In FIMI '03, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, November 2003.
22. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In SIGMOD Conference, pages 1-12, 2000.
23. M. Kantola, H. Mannila, K. J. Rih, and H. Siirtola. Discovering functional and inclusion dependencies in relational databases. International Journal of Intelligent Systems, 7:591-607, 1992.
24. A. Koeller and E. A. Rundensteiner. Discovery of high-dimentional inclusion dependencies (poster). In Poster session of ICDE conference. IEEE Computer Society, 2003.
25. M. Kryszkiewicz and M. Gajek. Concise representation of frequent patterns based on generalized disjunction-free generators. In PAKDD'02, Taipei, Taiwan, volume 2336 of Lecture Notes in Computer Science, pages 159-171. Springer, 2002.
26. G. Liu, H. Lu, J. X. Yu, W. Wei, and X. Xiao. AFOPT: An efficient implementation of pattern growth approach. In FIMI '03, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, 2003.
27. W. A. Maniatty, G. Ramesh, and M. J. Zaki. Feasible itemset distributions in data mining: Theory and application. In SIGMOD conference, San Diego, USA, pages 284-295. ACM, June 2003.
28. H. Mannila and K. J. Räihä. The Design of Relational Databases. Addison-Wesley, second edition, 1994.
29. H. Mannila and H. Toivonen. Multiple uses of frequent sets and condensed representations (extended abstract). In KDD conference,Portland, USA, pages 189-194. AAAI Press, 1996.
30. H. Mannila and H. Toivonen. Levelwise Search and Borders of Theories in Knowledge Discovery. Data Mining and Knowledge Discovery, 1(1):241-258, 1997.
31. S. Orlando, C. Lucchese, P. Palmerini, R. Perego, and F. Silvestri. kDCI: a multi-strategy algorithm for mining frequent sets. In FIMI '03, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, November 2003.
32. P. Palmerini, S. Orlando, and R. Perego. Statistical properties of transactional databases. In ACM symposium on Applied computing, pages 515-519, New York, USA, 2004. ACM Press.
33. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1):25-46, 1999.
34. J. Pei, J. Han, and R. Mao. Closet: An efficient algorithm for mining frequent closed itemsets. In SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pages 21-30, 2000.
35. T. Uno, T. Asai, Y. Uchida, and H. Arimura. LCM: An efficient algorithm for enumerating frequent closed item sets. In FIMI '03, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, November 2003.
36. T. Uno, M. Kiyomi, and H. Arimura. LCM ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets. In FIMI '04, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, 2004.
37. O. R. Zaïane, M. El-Hajj, Y. Li, and S. Luk. Scrutinizing frequent pattern discovery performance. In ICDE, pages 1109-1110, 2005.
38. M. J. Zaki and C.-J. Hsiao. Charm: An efficient algorithm for closed itemset mining. In SIAM International Conference on Data Mining, 2002.