Conference paper
Maintaining Bernoulli samples over evolving multisets
Rainer Gemulla, Wolfgang Lehner, et al.
SIGMOD/PODS/ 2007
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.
Rainer Gemulla, Wolfgang Lehner, et al.
SIGMOD/PODS/ 2007
Wang-Chiew Tan, Peter J. Haas, et al.
IHI 2012
Peter J. Haas, Arun N. Swami
SIGMOD 1992
Peter J. Haas, Ihab F. Ilyas, et al.
Statistical Analysis and Data Mining