Kevin Beyer, Rainer Gemulla, et al.
Communications of the ACM
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.
Kevin Beyer, Rainer Gemulla, et al.
Communications of the ACM
Peter J. Haas, Ihab F. Ilyas, et al.
Statistical Analysis and Data Mining
Peter J. Haas, Gerald S. Shedler
Discrete Event Dynamic Systems: Theory and Applications
Peter J. Haas, Gerald S. Shedler
Communications in Statistics. Stochastic Models