Efficient Data Reduction with EASE

Efficient Data Reduction with EASE (2003)

Cached

Download Links

by Hervé Brönnimann , Bin Chen , Peter Haas, et al.

Citations:

BibTeX

@MISC{Brönnimann03efficientdata,
    author = {Hervé Brönnimann and Bin Chen and Peter Haas and et al.},
    title = {Efficient Data Reduction with EASE},
    year = {2003}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

2159	Fast algorithms for mining association rules - Agrawal, Srikant - 1994
1953	Mining association rules between sets of items in large databases - Agrawal, Imielinski, et al. - 1993
1515	A Theory of the Learnable - Valiant - 1984
1478	The probabilistic method - Spencer - 1992
883	Mining frequent patterns without candidate generation - Han, Pei, et al.
630	Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals - Gray, Bosworth, et al. - 1996
330	Sampling Large Databases for Association Rules - Toivonen - 1996
269	Approximate frequency counts over data streams - MANKU, R
68	The Discrepancy Method - Chazelle - 2000
44	Product Range Spaces, Sensitive Sampling, and Derandomization - Brönnimann, Chazelle, et al. - 1999
44	Evaluation of sampling for data mining of association rules - Zaki, Parthasarathy, et al. - 1996
20	A new two-phase sampling based algorithm for discovering association rules - Chen, Haas, et al. - 2002
17	Derandomization in computational geometry - Matousek - 1996
11	Efficient data-reduction methods for on-line association rule discovery - Brönnimann, Chen, et al. - 2004