Tight upper bounds on the number of candidate patterns

ACM Transactions on Database Systems

Volumn 30, Issue 2, 2005, Pages 333-363

  Geerts, Floris ^a   Goethals, Bart ^b,d   Van Bussche, Jan Den ^c  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b UNIVERSITY OF HELSINKI   (Finland)

^c HASSELT UNIVERSITY   (Belgium)

^d UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

Additional Key Words and Phrases: Data mining; Frequent patterns; Upper bounds

Indexed keywords

CANDIDATE PATTERNS; COMBINATORIAL EXPLOSION; STANDARD LEVELWISE ALGORITHM;

ALGORITHMS; COMBINATORIAL MATHEMATICS; DATA MINING;

PATTERN RECOGNITION;

EID: 23944472645     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/1071610.1071611     Document Type: Review

References (31)

1. AGABWAL, R., AGGARWAL, C., AND PRASAD, V. 2000. Depth first generation of long patterns. In Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, R. Ramakrishnan, S. Stolfo, R. Bayardo, and I. Parsa, Eds. ACM Press, 108-118.
2. AGARWAL, R., AGGARWAL, C., AND PRASAD, V. 2001. A tree projection algorithm for generation of frequent itemsets. J. Parallel Distrib. Comput. 61, 3 (March), 350-371.
3. AGRAWAL, R., IMIELINSKI, T., AND SWAMI, A. 1993. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, P. Buneman and S. Jajodia, Eds. SIGMOD Record, vol. 22:2. ACM Press, 207-216.
4. AGRAWAL, R., MANNILA, H., SRIKANT, R., TOIVONEN, H., AND VERKAMO, A. 1996. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, U. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, Eds. MIT Press, 307-328.
5. AGRAWAL, R. AND SRIKANT, R. 1994a. Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Data Bases, J. Bocca, M. Jarke, and C. Zaniolo, Eds. Morgan Kaufmann, 487-499.
6. AGRAWAL, R. AND SRIKANT, R. 1994b. Fast algorithms for mining association rules. IBM Research Report RJ9839, IBM Alamaden Research Center, San Jose, California. June.
7. AGRAWAL, R. AND SRIKANT, R. 1994c. Quest Synthetic Data Generator. IBM Alamaden Research Center, http://www.almaden.ibm.com/software/quest/Resources/index.shtml.
8. BAYARDO, R. 1998. Efficiently mining long patterns from databases. In Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, L. Haas and A. Tiwary, Eds. SIGMOD Record, vol. 27:2. ACM Press, 85-93.
9. BLAKE, C. AND MERZ, C. 1998. UCI Repository of machine learning databases. University of California, Irvine, Dept. of Information and Computer Sciences, http://www.ics.uci.edu/mlearn/MLRepository.html.
10. BOLLOBÁS, B. 1986. Combinatorics. Cambridge University Press.
11. BOULICAUT, J.-F., BYKOWSKI, A., AND RIGOTTI, C. 2003. Free-sets: a condensed representation of Boolean data for frequency query approximation. Data Mining and Knowledge Discovery 7, 1, 5-22.
12. BRIN, S., MOTWANI, R., ULLMAN, J., AND TSUR, S. 1997. Dynamic itemset counting and implication rules for market basket data. In Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data. SIGMOD Record, vol. 26:2. ACM Press, 255-264.
13. BURDICK, D., CALIMLIM, M., AND GEHRKE, J. 2001. MAFIA: A maximal frequent itemset algorithm for transactional databases. In Proceedings of the 17th International Conference on Data Engineering. IEEE Computer Society, 443-452.
14. FRANKL, P. 1984. A new short proof for the Kruskal-Katona theorem. Discrete Mathematics 48, 327-329.
15. GEERTS, F., GOETHALS, B., AND VAN DEN BUSSCHE, J. 2001. A tight upper bound on the number of candidate patterns. In Proceedings of the 2001 IEEE International Conference on Data Mining, N. Cereone, T. Lin, and X. Wu, Eds. IEEE Computer Society, 155-162.
16. GOETHALS, B. AND ZAKI, M. J., Eds. 2003. Proceedings of the Workshop on Frequent Itemset Mining Implementations (FIMI-03), Melbourne Florida, USA, November 19, 2003. CEUR Workshop Proceedings, vol. 90. http://CEUR-WS.org/Vol-90/.
17. HAN, J., PEI, J., AND YIN, Y. 2000. Mining frequent patterns without candidate generation. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, W. Chen, J. Naughton, and P. Bernstein, Eds. SIGMOD Record, vol. 29:2. ACM Press, 1-12.
18. KATONA, G. 1968. A theorem of finite sets. In Theory Of Graphs. Akadémia Kiadó, 187-207.
19. KOHAVI, R., BRODLEY, C., FRASCA, B., MASON, L., AND ZHENG, Z. 2000. KDD-Cup 2000 organizers' report: Peeling the onion. SIGKDD Explorations 2, 2, 86-98. http://www.ecn.purdue.edu/KDDCUP.
20. KRUSKAL, J. 1963. The number of simplices in a complex. In Mathematical Optimization Techniques. Univ. of California Press, 251-278.
21. LIN, D. AND KEDEM, Z. 1998. Pincer-search: A new algorithm for discovering the maximum frequent set. In EDBT, H.-J. Schek, F. Saltor, I. Ramos, and G. Alonso, Eds. Lecture Notes in Computer Science, vol. 1377. Springer, 105-119.
22. LIU, J., PAN, Y., WANG, K., AND HAN, J. 2002. Mining frequent item sets by opportunistic projection. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, D. Hand, D. Keim, and R. Ng, Eds. ACM Press, 229-238.
23. ORLANDO, S., PALMERINI, P., PEREGO, R., AND SILVESTRI, F. 2002. Adaptive and resource-aware mining of frequent sets. In Proceedings of the 2002 IEEE International Conference on Data Mining, V. Kumar, S. Tsumoto, P. Yu, and N.Zhong, Eds. IEEE Computer Society, to appear.
24. PARK, J., CHEN, M.-S., AND YU, P. 1995. An effective hash based algorithm for mining association rules. In Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data. SIGMOD Record, vol. 24:2. ACM Press, 175-186.
25. PASQUIER, N., BASTIDE, Y., TAOUIL, R., AND LAKHAL, L. 1999. Discovering frequent closed itemsets for association rules. In Proceedings of the 7th International Conference on Database Theory, C. Beeri and P. Buneman, Eds. Incs, vol. 1540. Springer, 398-416.
26. PEI, J., HAN, J., AND MAO, R. 2000. Closet: An efficient algorithm for mining frequent closed itemsets. ACM SIGMOD'00 Workshop on Research Issues in Data Mining and Knowledge Discovery.
27. SAVASERE, A., OMIECINSKI, E., AND NAVATHE, S. 1995. An efficient algorithm for mining association rules in large databases. In Proceedings of the 21th International Conference on Very Large Data Bases, U. Dayal, P. Gray, and S. Nishio, Eds. Morgan Kaufmann, 432-444.
28. TOIVONEN, H. 1996. Sampling large databases for association rules. In Proceedings of the 22th International Conference on Very Large Data Bases, T. M. Vijayaraman, A. P. Buchmann, C. Mohan, and N. L. Sarda, Eds. Kaufmann, 134-145.
29. ZAKI, M. AND HSIAO, C.-J. 2002. CHARM: An efficient algorithm for closed itemset mining. In Proceedings of the Second SIAM International Conference on Data Mining, R. Grossman, J. Han, V. Kumar, H. Mannila, and R. Motwani, Eds. SIAM.
30. ZAKI, M., PARTHASARATHY, S., OGIHARA, M., AND LI, W. 1997. New algorithms for fast discovery of association rules. In Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, D. Heckerman, H. Mannila, and D. Pregibon, Eds. AAAI Press, 283-296.
31. ZHENG, Z., KOHAVI, R., AND MASON, L. 2001. Real world performance of association rule algorithms. In Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, F. Provost and R. Srikant, Eds. ACM Press, 401-406.