Efficient data reduction with EASE
暂无分享,去创建一个
Bin Chen | Peter J. Haas | Peter Scheuermann | Manoranjan Dash | Hervé Brönnimann | P. Haas | Bin Chen | Hervé Brönnimann | M. Dash | P. Scheuermann
[1] Leslie G. Valiant,et al. A theory of the learnable , 1984, CACM.
[2] Jirí Matousek. Derandomization in Computational Geometry , 2000, Handbook of Computational Geometry.
[3] Hannu Toivonen,et al. Sampling Large Databases for Association Rules , 1996, VLDB.
[4] Srinivasan Parthasarathy,et al. Evaluation of sampling for data mining of association rules , 1997, Proceedings Seventh International Workshop on Research Issues in Data Engineering. High Performance Database Management for Large-Scale Applications.
[5] Bernard Chazelle,et al. The discrepancy method - randomness and complexity , 2000 .
[6] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[7] Bernard Chazelle,et al. The Discrepancy Method , 1998, ISAAC.
[8] Hamid Pirahesh,et al. Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals , 1996, Data Mining and Knowledge Discovery.
[9] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.
[10] Ramakrishnan Srikant,et al. Fast algorithms for mining association rules , 1998, VLDB 1998.
[11] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[12] H. Ni. Product Range Spaces, Sensitive Sampling, and Derandomization , 1993 .
[13] Bin Chen,et al. Efficient Data-Reduction Methods for On-line Association Rule Discovery , 2004 .
[14] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.
[15] Bin Chen,et al. A new two-phase sampling based algorithm for discovering association rules , 2002, KDD.