Pushing convertible constraints in frequent itemset mining

Data Mining and Knowledge Discovery

Volumn 8, Issue 3, 2004, Pages 227-252

  Pei, Jian ^a   Han, Jiawei ^b   Lakshmanan, Laks V S ^c  

^a UNIVERSITY AT BUFFALO   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^c UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Algorithm; Constraint; Convertible constraint; Frequent itemset mining; Pruning

Indexed keywords

ALGEBRA; ALGORITHMS; CONSTRAINT THEORY; DATABASE SYSTEMS; OPTIMIZATION; SEMANTICS;

ASSOCIATIONS; CONVERTIBLE CONSTRAINTS; FREQUENT ITEMSET MINING; PRUNING;

DATA MINING;

EID: 3543095068     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:DAMI.0000023674.74932.4c     Document Type: Article

References (24)

1. Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules. In Proc. 1994 Int. Conf. Very Large Data Bases (VLDB'94), Santiago, Chile, pp. 487-499.
2. Agrawal, R. and Srikant, R. 1995. Mining sequential patterns. In Proc. 1995 Int. Conf. Data Engineering (ICDE'95), Taipei, Taiwan, pp. 3-14.
3. Bayardo, R.J. 1998. Efficiently mining long patterns from databases. In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'98), Seattle, WA, pp. 85-93.
4. Bayardo, R.J., Agrawal, R., and Gunopulos, D. 1999. Constraint-based rule mining on large, dense data sets. In Proc. 1999 Int. Conf. Data Engineering (ICDE'99), Sydney, Australia, pp. 188-197.
5. Brin, S., Motwani, R., and Silverstein, C. 1997. Beyond market basket: Generalizing association rules to correlations. In Proc. 1997 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'97), Tucson, Arizona, pp. 265-276.
6. Dong, G. and Li, J. 1999. Efficient mining of emerging patterns: Discovering trends and differences. In Proc. 1999 Int. Conf. Knowledge Discovery and Data Mining (KDD'99), San Diego, CA, pp. 43-52.
7. Garofalakis, M., Rastogi, R., and Shim, K. 1999. SPIRIT: Sequential pattern mining with regular expression constraints. In Proc. 1999 Int. Conf. Very Large Data Bases (VLDB'99), Edinburgh, UK, pp. 223234.
8. Grahne, G., Lakshmanan, L., and Wang, X. 2000. Efficient mining of constrained correlated sets. In Proc. 2000 Int. Conf. Data Engineering (ICDE'00), San Diego, CA, pp. 512-521.
9. Han, J., Dong, G., and Yin, Y. 1999. Efficient mining of partial periodic patterns in time series database. In Proc. 1999 Int. Conf. Data Engineering (ICDE'99), Sydney, Australia, pp. 106-115.
10. 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.
11. Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H., and Verkamo, A.I. 1994. Finding interesting rules from large sets of discovered association rules. In Proc. 3rd Int. Conf. Information and Knowledge Management, Gaithersburg, Maryland, pp. 401-408.
12. Lakshmanan, L.V.S., Ng, R., Han, J., and Pang, A. 1999. Optimization of constrained frequent set queries with 2-variable constraints. In Proc. 1999 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'99), Philadelphia, PA, pp. 157-168.
13. Lent, B., Swami, A., and Widom, J. 1997. Clustering association rules. In Proc. 1997 Int. Conf. Data Engineering (ICDE'97), Birmingham, England, pp. 220-231.
14. Mannila, H., Toivonen, H., and Verkamo, A.I. 1994. Efficient algorithms for discovering association rules. In Proc. AAAI'94 Workshop Knowledge Discovery in Databases (KDD'94), Seattle, WA, pp. 181-192.
15. Mannila, H., Toivonen, H., and Verkamo, A.I. 1997. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1:259-289.
16. Ng, R., Lakshmanan, L.V.S., Han, J., and Pang, A. 1998. Exploratory mining and pruning optimizations of constrained associations rules. In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'98), Seattle, WA, pp. 13-24.
17. Pei, J. and Han, J. 2000. Can we push more constraints into frequent pattern mining? In Proc. 2000 ACM SIGKDD Int., Conf. Knowledge Discovery in Databases (KDD'00), Boston, MA, pp. 350-354.
18. Pei, J., Han, J., and Lakshmanan, L.V.S. 2001. Mining frequent itemsets with convertible constraints. In Proc. 2001 Int. Conf. Data Engineering (ICDE'01), Heidelberg, Germany, pp. 433-332.
19. Pei, J., Han, J., and Mao, R. 2000. CLOSET: An efficient algorithm for mining frequent closed itemsets. In Proc. 2000 ACM-SIGMOD Int. Workshop Data Mining and Knowledge Discovery (DMKD'00), Dallas, TX, pp. 11-20.
20. Pei, J., Han, J., and Wang, W. 2002, Constraint-based sequential pattern mining in large databases. In Proc. 2002 Int. Conf. on Information and Knowledge Management (CIKM'02), McLean, VA.
21. Rymon, R. 1992. Search through systematic set enumeration. In Proc. 1992 Int. Conf. Principle of Knowledge Representation and Reasoning (KR'92), Cambridge, MA, pp. 539-550.
22. Silverstein, C., Brin, S., Motwani, R., and Ullman, J. 1998. Scalable techniques for mining causal structures. In Proc. 1998 Int. Conf. Very Large Data Bases (VLDB'98), New York, NY, pp. 594-605.
23. Srikant, R., Vu, Q., and Agrawal, R. 1997. Mining association rules with item constraints. In Proc. 1997 Int. Conf. Knowledge Discovery and Data Mining (KDD'97), Newport Beach, CA, pp. 67-73.
24. Webb, G.I. 1995. Opus: An efficient admissible algorithm for unordered search. Journal of Artificial Intelligence Research, 3:431-465.