Mining frequent patterns without candidate generation

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 29, Issue 2, 2000, Pages 1-12

  Han, Jiawei ^a   Pei, Jian ^a   Yin, Yiwen ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039253846     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/335191.335372     Document Type: Article

References (20)

1. R. Agarwal, C. Aggarwal, and V. V. V. Prasad. Depth-first generation of large itemsets for association rules. IBM Tech. Report RC21538, July 1999.
2. R. Agarwal, C. Aggarwal, and V. V. V. Prasad. A tree projection algorithm for generation of frequent itemsets. In J. Parallel and Distributed Computing, 2000.
3. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB'94, pp. 487-499.
4. R. Agrawal and R. Srikant. Mining sequential patterns. In ICDE'95, pp. 3-14.
5. R. J. Bayardo. Efficiently mining long patterns from databases. In SIGMOD'98, pp. 85-93.
6. S. Brin, R. Motwani, and C. Silverstein. Beyond market basket: Generalizing association rules to correlations. In SIGMOD'97, pp. 265-276.
7. G. Dong and J. Li. Efficient mining of emerging patterns: Discovering trends and differences. In KDD'99, pp. 43-52.
8. G. Grahne, L. Lakshmanan, and X. Wang. Efficient mining of constrained correlated sets. In ICDE'00.
9. J. Han, G. Dong, and Y. Yin. Efficient mining of partial periodic patterns in time series database. In ICDE'99, pp. 106-115.
10. J. Han, J. Pei, and Y. Yin. Mining partial periodicity using frequent pattern trees. In CS Tech. Rep. 99-10, Simon Fraser University, July 1999.
11. M. Kamber, J. Han, and J. Y. Chiang. Metarule-guided mining of multi-dimensional association rules using data cubes. In KDD'97, pp. 207-210.
12. M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, and A.I. Verkamo. Finding interesting rules from large sets of discovered association rules. In CIKM'94, pp. 401-408.
13. B. Lent, A. Swami, and J. Widom. Clustering association rules. In ICDE'97, pp. 220-231.
14. H. Mannila, H Toivonen, and A. I. Verkamo. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1:259-289, 1997.
15. R. Ng, L. V. S. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained associations rules. In SIGMOD'98, pp. 13-24.
16. J.S. Park, M.S. Chen, and P.S. Yu. An effective hash-based algorithm for mining association rules. In SIGMOD'95, pp. 175-186.
17. S. Sarawagi, S. Thomas, and R. Agrawal. Integrating association rule mining with relational database systems: Alternatives and implications. In SIGMOD'98, pp. 343-354.
18. A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In VLDB'95, pp. 432-443.
19. C. Silverstein, S. Brin, R. Motwani, and J. Ullman. Scalable techniques for mining causal structures. In VLDB'98, pp. 594-605.
20. R. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item constraints. In KDD'97, pp. 67-73.