Mining Frequent Patterns without Candidate Generation.

@inproceedings{DBLP:conf/sigmod/HanPY00,
  author    = {Jiawei Han and
               Jian Pei and
               Yiwen Yin},
  editor    = {Weidong Chen and
               Jeffrey F. Naughton and
               Philip A. Bernstein},
  title     = {Mining Frequent Patterns without Candidate Generation},
  booktitle = {Proceedings of the 2000 ACM SIGMOD International Conference on
               Management of Data, May 16-18, 2000, Dallas, Texas, USA},
  publisher = {ACM},
  year      = {2000},
  isbn      = {1-58113-218-2},
  pages     = {1-12},
  ee        = {http://doi.acm.org/10.1145/342009.335372, db/conf/sigmod/HanPY00.html},
  crossref  = {DBLP:conf/sigmod/2000},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 2000 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

Online Edition

References

[1]

...

[2]

...

[3]

Rakesh Agrawal, Ramakrishnan Srikant: Fast Algorithms for Mining Association Rules in Large Databases. VLDB 1994: 487-499 BibTeX

[4]

Rakesh Agrawal, Ramakrishnan Srikant: Mining Sequential Patterns. ICDE 1995: 3-14 BibTeX

[5]

Roberto J. Bayardo Jr.: Efficiently Mining Long Patterns from Databases. SIGMOD Conference 1998: 85-93 BibTeX

[6]

Sergey Brin, Rajeev Motwani, Craig Silverstein: Beyond Market Baskets: Generalizing Association Rules to Correlations. SIGMOD Conference 1997: 265-276 BibTeX

[7]

Guozhu Dong, Jinyan Li: Efficient Mining of Emerging Patterns: Discovering Trends and Differences. KDD 1999: 43-52 BibTeX

[8]

Gösta Grahne, Laks V. S. Lakshmanan, Xiaohong Wang: Efficient Mining of Constrained Correlated Sets. ICDE 2000: 512-521 BibTeX

[9]

Jiawei Han, Guozhu Dong, Yiwen Yin: Efficient Mining of Partial Periodic Patterns in Time Series Database. ICDE 1999: 106-115 BibTeX

[10]

...

[11]

Micheline Kamber, Jiawei Han, Jenny Chiang: Metarule-Guided Mining of Multi-Dimensional Association Rules Using Data Cubes. KDD 1997: 207-210 BibTeX

[12]

Mika Klemettinen, Heikki Mannila, Pirjo Ronkainen, Hannu Toivonen, A. Inkeri Verkamo: Finding Interesting Rules from Large Sets of Discovered Association Rules. CIKM 1994: 401-407 BibTeX

[13]

Brian Lent, Arun N. Swami, Jennifer Widom: Clustering Association Rules. ICDE 1997: 220-231 BibTeX

[14]

Heikki Mannila, Hannu Toivonen, A. Inkeri Verkamo: Discovery of Frequent Episodes in Event Sequences. Data Min. Knowl. Discov. 1(3): 259-289(1997) BibTeX

[15]

Raymond T. Ng, Laks V. S. Lakshmanan, Jiawei Han, Alex Pang: Exploratory Mining and Pruning Optimizations of Constrained Association Rules. SIGMOD Conference 1998: 13-24 BibTeX

[16]

Jong Soo Park, Ming-Syan Chen, Philip S. Yu: An Effective Hash Based Algorithm for Mining Association Rules. SIGMOD Conference 1995: 175-186 BibTeX

[17]

Sunita Sarawagi, Shiby Thomas, Rakesh Agrawal: Integrating Mining with Relational Database Systems: Alternatives and Implications. SIGMOD Conference 1998: 343-354 BibTeX

[18]

Ashok Savasere, Edward Omiecinski, Shamkant B. Navathe: An Efficient Algorithm for Mining Association Rules in Large Databases. VLDB 1995: 432-444 BibTeX

[19]

Craig Silverstein, Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman: Scalable Techniques for Mining Causal Structures. VLDB 1998: 594-605 BibTeX

[20]

Ramakrishnan Srikant, Quoc Vu, Rakesh Agrawal: Mining Association Rules with Item Constraints. KDD 1997: 67-73 BibTeX

Referenced by

1. Toon Calders, Jan Paredaens: Axiomatization of Frequent Sets. ICDT 2001: 204-218
2. Ke Wang, Yu He, Jiawei Han: Mining Frequent Itemsets Using Support Constraints. VLDB 2000: 43-52