Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
We consider the problem of mining association rules on a shared-nothing multiprocessor. We present three algorithms that explore a spectrum of trade-offs between computation, communication, memory usage, synchronization, and the use of problem-specific information. The best algorithm exhibits near perfect scaleup behavior, yet requires only minimal overhead compared to the current best serial algorithm. ©1996 IEEE.
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
Raymond Wu, Jie Lu
ITA Conference 2007