Conference paper
Compressed linear algebra for largescale machine learning
Ahmed Elgohary, Matthias Boehm, et al.
VLDB 2016
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.
Ahmed Elgohary, Matthias Boehm, et al.
VLDB 2016
Peter J. Haas, Fabian Hueske, et al.
VLDB 2007
Bin Chen, Peter Haas, et al.
KDD 2002
Ahmed Elgohary, Matthias Boehm, et al.
SIGMOD Record