Conference paper
Efficient data reduction with EASE
Hervé Brönnimann, Bin Chen, et al.
KDD 2003
A sampling-based algorithm for discovering association rules is presented. The finding associations from sampled transactions (FAST) algorithm is a refined sampling-based mining algorithm that is distinguished from other algorithms by its novel two-phase approach to sample collection. Results showed that the FAST is a promising algorithms in situations where good approximate answers suffice and the interactive, real time response is essential.
Hervé Brönnimann, Bin Chen, et al.
KDD 2003
Peter W. Glynn, Peter J. Haas
Commun Stat Theory Methods
Peter J. Haas
IEEE Transactions on Software Engineering
Ahmed Elgohary, Matthias Boehm, et al.
CACM