Bum Chul Kwon, Janu Verma, et al.
IEE CG&A
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.
Bum Chul Kwon, Janu Verma, et al.
IEE CG&A
Viswanath Poosala, Peter J. Haas, et al.
SIGMOD Record (ACM Special Interest Group on Management of Data)
Ravi Jampani, Luis Leopoldo Perez, et al.
SIGMOD 2008
Peter W. Glynn, Peter J. Haas
Commun Stat Theory Methods