Conference paper
Techniques for warehousing of sample data
Paul G. Brown, Peter J. Haas
ICDE 2006
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.
Paul G. Brown, Peter J. Haas
ICDE 2006
Ahmed Elgohary, Matthias Boehm, et al.
CACM
Hervé Brönnimann, Bin Chen, et al.
KDD 2003
Peter J. Haas, Gerald S. Shedler
Communications in Statistics. Stochastic Models