Conference paper
Online query processing: A tutorial
Peter J. Haas, Joseph M. Hellerstein
SIGMOD 2001
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.
Peter J. Haas, Joseph M. Hellerstein
SIGMOD 2001
Gang Luo, Curt J. Ellmann, et al.
SIGMOD 2002
Peter J. Haas, Gerald S. Shedler
Probab. Eng. Inf. Sci.
Peter J. Haas
Communications in Statistics. Part C: Stochastic Models