Conference paper
Dynamic interaction graphs with probabilistic edge decay
Wenlei Xie, Yuanyuan Tian, et al.
ICDE 2015
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.
Wenlei Xie, Yuanyuan Tian, et al.
ICDE 2015
Peter J. Haas
WSC 2014
Paul G. Brown, Peter J. Haas
ICDE 2006
Rainer Gemulla, Peter J. Haas, et al.
KDD 2011