DualMiner: A Dual-Pruning Algorithm for Itemsets with Constraints

Data Mining and Knowledge Discovery

Volumn 7, Issue 3, 2003, Pages 241-272

  Bucilǎ, Cristian ^a   Gehrke, Johannes ^a   Kifer, Daniel ^a   White, Walker ^b  

^a Department of Obstetrics Gynecology   (United States)

^b UNIVERSITY OF DALLAS   (United States)

Author keywords

Association rules; Constrained frequent itemsets; Constraints in data mining; Data mining; Market basket analysis

Indexed keywords

ASSOCIATION RULES; MARKET BASKET ANALYSIS; SEQUENTIAL PATTERNS;

ALGORITHMS; CONSTRAINT THEORY; DATABASE SYSTEMS; SET THEORY;

DATA MINING;

EID: 0037865635     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1024076020895     Document Type: Conference Paper

References (24)

1. Agrawal, R., Imielinski, T., and Swami, A.N. 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.). Washington, DC: ACM Press, pp. 207-216.
2. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., and Verkamo, A.I. 1996. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy (Eds.). AAAI/MIT Press, Chap. 12, pp. 307-328.
3. Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules in large databases. In VLDB'94, Proceedings of 20th International Conference on Very Large Data Bases, J.B. Bocca, M. Jarke, and C. Zaniolo (Eds.). Santiago de Chile, Chile: Morgan Kaufmann, pp. 487-499.
4. Bayardo, R.J. 1998. Efficiently mining long patterns from databases. In SIGMOD 1998, Proceedings of ACM SIGMOD International Conference on Management of Data, L.M. Haas and A. Tiwary (Eds.). Seattle, WA: ACM Press, pp. 85-93.
5. Bayardo, R.J., Agrawal, R., and Gunopulos, D. 2000. Constraint-based rule mining in large, dense databases. Data Mining and Knowledge Discovery, 4(2/3):217-240.
6. Boulicaut, J. and Jeudy, B. 2000. Using constraints during set mining: Should we prune or not.
7. Boulicaut, J.-F. and Jeudy, B. 2001. Mining free itemsets under constraints. In International Database Engineering and Application Symposium, pp. 322-329.
8. Burdick, D., Calimlim, M., and Gehrke, J. 2001. Mafia: A maximal frequent itemset algorithm for transactional databases. In ICDE 2001. IEEE Computer Society.
9. Delis, A., Faloutsos, C., and Ghandeharizadeh, S. (Eds.). 1999. SIGMOD 1999, Philadephia, PA: ACM Press.
10. Gunopulos, D., Mannila, H., Khardon, R., and Toivonen, H. 1997. Data mining, hypergraph transversals, and machine learning. In Proc. PODS 1997, pp. 209-216.
11. Haas, L.M. and Tiwary, A. (Eds.). 1998. SIGMOD 1998, Proceedings ACM SIGMOD International Conference on Management of Data, Seattle, WA: ACM Press.
12. Han, J., Pei, J., Dong, G., and Wang, K. 2001. Efficient computation of iceberg cubes with complex measures. In SIGMOD Conference.
13. Hipp, J. and Guntzer, U. 2002. Is pushing constraints deeply into the mining algorithms really what we want? SIGKDD Explorations, 4(1):50-55.
14. Lakshmanan, L.V.S., Ng, R.T., Han, J., and Pang, A. 1999. Optimization of constrained frequent set queries with 2-variable constraints. In SIGMUD 1999, Delis, Faloutsos, and Ghandeharizadeh (Eds.). Philadephia, PA: ACM Press, pp. 157-168.
15. Leung, C.K.-S., Lakshmanan, L.V., and Ng, R.T. 2002. Exploiting succinct constraints using fp-trees. SIGKDD Explorations, 4(1):31-39.
16. Ng, R.T., Lakshmanan, L.V.S., Han, J., and Mah, T. 1999. Exploratory mining via constrained frequent set queries. In SIGMUD 1999, Delis, Faloutsos, and Ghandeharizadeh (Eds.). Philadephia, PA: ACM Press, pp. 556-558.
17. Ng, R.T., Lakshmanan, L.V.S., Han, J., and Pang, A. 1998. Exploratory mining and pruning optimizations of constrained association rules. In SIGMOD 1998, Proceedings ACM SIGMOD International Conference on Management of Data, Haas, and Tiwary (Eds.). Seattle, WA: ACM Press, pp. 13-24.
18. Pei, J. and Han, J. 2000. Can we push more constraints into frequent pattern mining? In ACM SIGKDD Conference, pp. 350-354.
19. Pei, J. and Han, J. 2002. Constrained frequent pattern mining: A pattern-growth view. SIGKDD Explorations, 4(1):31-39.
20. Pei, J., Han, J., and Lakshmanan, L.V.S. 2001. Mining frequent item sets with convertible constraints. In ICDE 2001, IEEE Computer Society, pp. 433-442.
21. Perng, C.-S., Wang, H., Ma, S., and Hellerstein, J.L. 2002. Discovery in multi-attribute data with user-defined constraints. SIGKDD Explorations, 4(1):56-64.
22. Raedt, L.D. and Kramer, S. 2001. The levelwise version space algorithm and its application to molecular fragment finding. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001), pp. 853-862.
23. Srikant, R., Vu, Q., and Agrawal, R. 1997. Mining association rules with item constraints. In Proc. 3rd Int. Conf. Knowledge Discovery and Data Mining, KDD, D. Heckerman, H. Mannila, D. Pregibon, and R. Uthurusamy (Eds.). AAAI Press, pp. 67-73.
24. IBM data generator. http://www.almaden.ibm.com/cs/quest/syndata.html.