Finding frequent patterns using length-decreasing support constraints

Data Mining and Knowledge Discovery

Volumn 10, Issue 3, 2005, Pages 197-228

  Seno, Masakazu ^a   Karypis, George ^a  

^a University of Minnesota   (United States)

Author keywords

Association rules; Data mining; Frequent pattern discovery; Scalability

Indexed keywords

ASSOCIATION RULES; FREQUENT PATTERN DISCOVERY; ITEMSET MODELS; SCALABILITY;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DATA MINING; DATABASE SYSTEMS; PROBLEM SOLVING;

PATTERN RECOGNITION;

EID: 22044458573     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-005-0364-0     Document Type: Article

References (32)

1. Agarwal, R., Aggarwal, C., Prasad, V., and Crestana, V. 1998. A tree projection algorithm for generation of large itemsets for association rules. IBM Research Report RC21341.
2. Agarwal, R.C., Aggarwal, C.C., and Prasad, V.V.V. 2000. Depth first generation of long patterns. In Knowledge Discovery and Data Mining, pp. 108-118.
3. Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules. In Proc. of the 20th Int'l Conference on Very Large Databases. Santiago, Chile.
4. Bayardo, R.J. 1998. Efficiently mining long patterns from databases. In Proceedings of ACM International Conference on Management of Data (SIGMOD). Seattle, Washington, pp. 85-93.
5. Brin, S., Motwani, R., and Silversteim, C. 1997. Beyond market baskets: Generalizing association rules to correlations. In Proc. of 1997 ACM-SIGMOD Int. Conf. on Management of Data. Tucson, Arizona.
6. Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., Motwani, R., Ullman, J.D., and Yang, C. 2000. Finding interesting associations without support pruning. In ICDE, pp. 489-499.
7. Guralnik, V., Garg, N., and Karypis, G. 2001. Parallel tree projection algorithm for sequence mining. In European Conference on Parallel Processing, pp. 310-320.
8. Gusfield, D. 1993. Efficient methods for multiple sequence alignment with guaranteed error bounds. Bull. Math. Biol., 55:141-154.
9. Han, J., Pei, J., and Yin, Y. 2000. Mining frequent patterns without candidate generation. In Proc. 2000 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'00). Dallas, TX, pp. 1-12.
10. Han, J., Wang, J., Lu, Y., and Tzvetkov, P. 2002. Mining top-K frequent closed patterns without minimum support. In IEEE International Conference on Data Mining.
11. Kohavi, R., Broadley, C., Frasca, B., Mason, L., and Zheng, Z. 2000. KDD-Cup 2000 organizers' report: Peeling the onion. SIGKDD Explorations, 2(2):86-98.
12. Kuramochi, M., Seno, M., and Karypis, G. 2003. PAFI a pattern finding toolkit, Technical report, Dept. of Computer Science, University of Minnesota. Available at http://www.cs.umn.edu/~pafi.
13. Lin, D. and Kedem, Z. 1998. Princer-Search: An efficient algorithm for discovering the maximum frequent set. In Proceedings of the 6th International Conference on Extending Database Technology.
14. Liu, B., Hsu, W., and Ma, Y. 1999. Mining association rules with multiple minimum supports. In SIGKDD 1999. Mount, D.W. 2001. Bioinformatics: Sequence and Genome Analysis. CSHL Press.
15. Mueller, A. 1995. Fast sequential and parallel algorithms for association rule mining: A comparison, Technical Report CS-TR-3515, College Park, MD.
16. Park, J., Chen, M., and Yu, P. 1995a. An effective hash-based algorithm for mining association rules. In Proc. of 1995 ACM-SIGMOD Int. Conf. on Management of Data.
17. Park, J., Chen, M., and Yu, P. 1995b. Efficient parallel data mining for association rules. In Proceedings of the 4th Int'l Conf. on Information and Knowledge Management.
18. Pasquier, N., Bastide, Y., Taouil, R., and Lakhal, L. 1999. Discovering frequent closed itemsets for association rules. In 7th International Conference on Database Theory, pp. 398-416.
19. Pei, J. and Han, J. 2000. Can we push more constraints into frequent pattern mining? In Proceedings of ACM SIGKDD International Conference on Knowledge Discovery & Data Mining.
20. Pei, J., Han, J., and Mao, R. 2000. CLOSET: An efficient algorithm for mining frequent closed itemsets. In Proc. 2000 of ACM-SIGMOD Int. Workshop on Data Mining and Knowledge Discovery.
21. Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., and Hsu, M. 2001. PrefixSpan: Mining sequential patterns by prefix-projected growth. In ICDE, pp. 215-224.
22. Savasere, A., Omiecinski, E., and Navathe, S. 1995. An efficient algorithm for mining association rules in large databases. In Proc. of the 21st VLDB Conference. Zurich, Switzerland, pp. 432-443.
23. Srikant, R. and Agrawal, R. 1995. Mining sequential patterns. In 11th Int. Conf. Data Engineering.
24. Srikant, R. and Agrawal, R. 1996. Mining sequential patterns: Generalizations and performance improvements. In Proc. of the Fifth Int'l Conference on Extending Database Technology. Avignon, France.
25. Wang, K., He, Y., and Han, J. 2000. Mining frequent itemsets using support constraints. The VLDB Journal, pp. 43-52.
26. Yan, Z., Han, J., and Afshar, R. 2003. CloSpan: Mining closed sequential patterns in large datasets. In SIAM Data Mining Conference.
27. Zaki, M.J. 1997. Fast mining of sequential patterns in very large databases. Technical Report 668, Department of Computer Science, Rensselaer Polytechnic Institute.
28. Zaki, M. 2000a. Generating non-redundant association rules. In 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 34-43.
29. Zaki, M.J. 2000b. Scalable algorithms for association mining. Knowledge and Data Engineering, 12(2):372-390.
30. Zaki, M.J. 2001. SPADE: An efficient algorithms for mining frequent sequences. Machine Learning Journal, 42:31-60.
31. Zaki, M.J. and Gouda, K. 2001. Fast vertical mining using diffsets. Technical Report 01-1, RPI.
32. Zheng, Z., Kohavi, R., and Mason, L. 2001. Real world performance of association rule algorithms. In Proc. of the Seventh ACM SIGKDD Internation Conference on Knoeledge Discovery and Data Mining, pp. 401-406.