Efficient Data-Reduction Methods for On-line Association Rule Discovery
暂无分享,去创建一个
Bin Chen | Peter J. Haas | Peter Scheuermann | Manoranjan Dash | Hervé Brönnimann | P. Haas | Bin Chen | Hervé Brönnimann | M. Dash | P. Scheuermann
[1] Ramesh C Agarwal,et al. Depth first generation of long patterns , 2000, KDD '00.
[2] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[3] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[4] P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .
[5] Bernard Chazelle,et al. The Discrepancy Method , 1998, ISAAC.
[6] Bin Chen,et al. A new two-phase sampling based algorithm for discovering association rules , 2002, KDD.
[7] George Varghese,et al. New directions in traffic measurement and accounting , 2002, CCRV.
[8] Jian Pei,et al. Efficient computation of Iceberg cubes with complex measures , 2001, SIGMOD '01.
[9] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.
[10] Rakesh Agarwal,et al. Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.
[11] Fritz Leiber,et al. The Big Time , 1958 .
[12] RamakrishnanRaghu,et al. Bottom-up computation of sparse and Iceberg CUBE , 1999 .
[13] Hannu Toivonen,et al. Sampling Large Databases for Association Rules , 1996, VLDB.
[14] Viswanath Poosala,et al. Congressional samples for approximate answering of group-by queries , 2000, SIGMOD '00.
[15] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.