Peter J. Haas, Gerald S. Shedler
Discrete Event Dynamic Systems: Theory and Applications
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.
Peter J. Haas, Gerald S. Shedler
Discrete Event Dynamic Systems: Theory and Applications
Yannis Sismanis, Paul Brown, et al.
VLDB 2006
Viswanath Poosala, Peter J. Haas, et al.
SIGMOD Record (ACM Special Interest Group on Management of Data)
Johanna Sommer, Matthias Boehm, et al.
SIGMOD 2019