Effective algorithm for mining compressed frequent patterns

[1] Agrawal R, Srikant R. Fast algorithms for mining association rules Proc of 1994 Int conf on VLDB. Santiago, Chile: VLDB, 1994:487-499 [2] Han J, Pei J, Yin Y. Mining frequent patterns without candidate generation Proc of the 2000 ACM SIGMOD. Dallas, USA: ACM ,2000:1-12 [3] Pasquier N, Bastide Y, Taouil R, et al. Discovering frequent closed itemsets for association rules Proc of the 7^th ICDT. Jerusalem, Israel: IEEE, 1999:134-145 [4] Wang J, Han J, Pei J. CLOSET+: Searching for the best strategies for mining frequent closed Itemsets Proc of the 2003 ACM SIGKDD. Washington DC, USA: ACM, 2003:236-245 [5] Grahne G, Zhu J. Efficiently using prefix-trees in mining frequent itemsets Proc of IEEE ICDM Workshop on FIMI. Melbourne, FL: IEEE, 2003:123-132 [6] Bayardo R. Efficiently mining long patterns from databases Proc of the ACM SIGMOD. Seattle, USA: ACM, 1998:85-93 [7] Afrati F N, Gionis A, Mannila H. Approximating a collection of frequent sets Proc of the 2004 ACM SIGKDD. Seattle, USA: ACM, 2004:12-19 [8] Xin D, Han J, Yan Y, et al. Mining compressed frequent-pattern sets Proc of the 2005 VLDB. Trondheim, Norway: VLDB, 2005:709-720