Pattern-Growth Methods - Frequent Pattern Mining - page 78

References
1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 1994 Int.
Conf. Very Large Data Bases (VLDB'94) , pages 487-499, Santiago, Chile, Sept. 1994.
2. R. Agrawal and R. Srikant. Mining sequential patterns. In Proc. 1995 Int. Conf. Data
Engineering (ICDE'95) , pages 3-14, Taipei, Taiwan, Mar. 1995.
3. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in
large databases. In Proc. 1993 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'93) ,
pages 207-216, Washington, DC, May 1993.
4. R. Agarwal, C. C. Aggarwal, and V. V. V. Prasad. Depth-first generation of large itemsets for
association rules. In IBM Technical Report RC21538 , July 1999.
5. R. J. Bayardo. Efficiently mining long patterns from databases. In Proc. 1998 ACM-SIGMOD
Int. Conf. Management of Data (SIGMOD'98) , pages 85-93, Seattle, WA, June 1998.
6. R. J. Bayardo, R. Agrawal, and D. Gunopulos. Constraint-based rule mining on large, dense
data sets. In Proc. 1999 Int. Conf. Data Engineering (ICDE'99) , pages 188-197, Sydney,
Australia, April 1999.
7. K. Beyer and R. Ramakrishnan. Bottom-up computation of sparse and iceberg cubes. In
Proc. 1999 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'99) , pages 359-370,
Philadelphia, PA, June 1999.
8. S. Brin, R. Motwani, and C. Silverstein. Beyond market basket: Generalizing association rules
to correlations. In Proc. 1997 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'97) ,
pages 265-276, Tucson, AZ, May 1997.
9. C. Chen, X. Yan, F. Zhu, and J. Han. gApprox: Mining frequent approximate patterns from a
massive network. In Proc. 2007 Int. Conf. Data Mining (ICDM'07) , Omaha, NE, Oct. 2007.
10. H. Cheng, X. Yan, J. Han, and C.-W. Hsu. Discriminative frequent pattern analysis for effective
classification. In Proc. 2007 Int. Conf. Data Engineering (ICDE'07) , pages 716-725, Istanbul,
Turkey, April 2007.
11. H. Cheng, X. Yan, J. Han, and P. S. Yu. Direct discriminative pattern mining for effective
classification. In Proc. 2008 Int. Conf. Data Engineering (ICDE'08) , Cancun, Mexico, April
2008.
12. G. Dong and J. Li. Efficient mining of emerging patterns: Discovering trends and differences.
In Proc. 1999 Int. Conf. Knowledge Discovery and Data Mining (KDD'99) , pages 43-52, San
Diego, CA, Aug. 1999.
13. M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, and J. D. Ullman. Computing iceberg
queries efficiently. In Proc. 1998 Int. Conf. Very Large Data Bases (VLDB'98) , pages 299-310,
New York, NY, Aug. 1998.
14. G. Grahne and J. Zhu. Efficiently using prefix-trees in mining frequent itemsets. In Proc.
ICDM'03 Int. Workshop on Frequent Itemset Mining Implementations (FIMI'03) , Melbourne,
FL, Nov. 2003.
15. G. Grahne, L.V.S. Lakshmanan, and X. Wang. Efficient mining of constrained correlated sets.
In Proc. 2000 Int. Conf. Data Engineering (ICDE'00) , pages 512-521, San Diego, CA, Feb.
2000.
16. J. Han, G. Dong, and Y. Yin. Efficient mining of partial periodic patterns in time series database.
In Proc. 1999 Int. Conf. Data Engineering (ICDE'99) , pages 106-115, Sydney, Australia, April
1999.
17. J. Han, J. Pei, B. Mortazavi-Asl, Q. Chen, U. Dayal, and M.-C. Hsu. FreeSpan: Frequent
pattern-projected sequential pattern mining. In Proc. 2000 ACM SIGKDD Int. Conf. Knowledge
Discovery in Databases (KDD'00) , pages 355-359, Boston, MA, Aug. 2000.
18. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. 2000
ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'00) , pages 1-12, Dallas, TX, May
2000.