Conference paper
Working Group: Classification, Representation and Modeling
Anish Das Sarma, Ander de Keijzer, et al.
Dagstuhl Seminar Proceedings 2008
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.
Anish Das Sarma, Ander de Keijzer, et al.
Dagstuhl Seminar Proceedings 2008
Rainer Gemulla, Wolfgang Lehner, et al.
VLDB Journal
Subi Arumugam, Ravi Jampani, et al.
VLDB
Byung-Kwon Choi, Tajhal Dayaram, et al.
PNAS