Joseph P. Bigus, M. Campbell, et al.
IBM J. Res. Dev
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.
Joseph P. Bigus, M. Campbell, et al.
IBM J. Res. Dev
Eirinaios Michelakis, Rajasekar Krishnamurthy, et al.
SIGMOD/PODS 2009
Bum Chul Kwon, Janu Verma, et al.
IEE CG&A
Rainer Gemulla, Peter J. Haas, et al.
VLDB Journal