On compressing frequent patterns

Data and Knowledge Engineering

Volumn 60, Issue 1, 2007, Pages 5-29

  Xin, Dong ^a   Han, Jiawei ^a   Yan, Xifeng ^a   Cheng, Hong ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Data mining; Frequent pattern mining

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA COMPRESSION; DATA STRUCTURES; PROBLEM SOLVING;

FREQUENT ITEMSET MINING IMPLEMENTATIONS (FIMI); FREQUENT PATTERN MINING;

DATA MINING;

EID: 33846032317     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2006.01.006     Document Type: Article

References (20)

1. F. Afrati, A. Gionis, H. Mannila, Approximating a collection of frequent sets, in Proc. KDD'04, pp. 12-19.
2. R. Agrawal, T. Imielinski, A. Swami, Mining association rules between sets of items in large databases, in: Proc. SIGMOD'93, pp. 207-216.
3. R. Agrawal, R. Srikant, Mining sequential patterns, in: Proc. ICDE'95, pp. 3-14.
4. Boulicaut J., Bykowski A., and Rigotti C. Free-sets: a condensed representation of Boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery Journal 7 1 (2003) 5-22
5. S. Brin, R. Motwani, C. Silverstein, Beyond market basket: generalizing association rules to correlations, in: Proc. SIGMOD'97, pp. 265-276.
6. T. Calders, B. Goethals, Mining all non-derivable frequent itemsets, in: Proc. PKDD'02, pp. 74-85.
7. Cormen T., Leiserson C., Rivest R., and Stein C. Introduction to Algorithms. second ed. (2001), MIT Press
8. Frequent Itemset Mining Dataset Repository, Available from: .
9. D. Gunopulos, H. Mannila, R. Khardon, H. Toivonen, Data mining, hypergraph transversals, and machine learning, in: Proc. PODS'97, pp. 209-216.
10. G. Grahne, J. Zhu, Efficiently using prefix-trees in mining frequent itemsets, in: Proc. IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03).
11. J. Han, G. Dong, Y. Yin, Efficient mining of partial periodic patterns in time series database, in: Proc. ICDE'99, pp. 106-115.
12. J. Han, J. Pei, Y. Yin, Mining frequent patterns without candidate generation, in: Proc. SIGMOD'00, pp. 1-12.
13. B. Lent, A. Swami, J. Widom, Clustering association rules, in: Proc. ICDE'97, pp. 220-231.
14. Mannila H., Towvonen H., and Verkamo A. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery 1 3 (1997) 259-289
15. Q. Mei, C. Zhai, Discovering evolutionary theme patterns from text: an exploration of temporal text mining, in: Proc. KDD'05, pp. 198-207.
16. N. Pasquier, Y. Bastide, R. Taouil, L. Lakhal, Discovering frequent closed itemsets for association rules, in: Proc. ICDT'99, pp. 398-416.
17. J. Pei, A. Tung, J. Han, Fault-tolerant frequent pattern mining: problems and challenges, in: Proc. DMKD'01.
18. C. Silverstein, S. Brin, R. Motwani, J. Ullman, Scalable techniques for mining causal structures, in: Proc. VLDB'98, pp. 594-605.
19. Singhal A. Modern information retrieval: a brief overview. Bull. IEEE CS Tech. Comm. Data Eng. 24 4 (2001) 35-43
20. M. Zaki, C. Hsiao, Charm: an efficient algorithm for closed itemset mining, in: Proc. SDM'02.