Ihab Ilyas, Volker Markl, et al.
ICAC 2004
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.
Ihab Ilyas, Volker Markl, et al.
ICAC 2004
Ning Zhang, Peter J. Haas, et al.
VLDB 2005
Peter J. Haas
Stochastic Models
Rainer Gemulla, Wolfgang Lehner, et al.
SIGMOD/PODS/ 2007