| Title | : | Frequent-Itemset Mining using Locality-Sensitive Hashing |
| Speaker | : | Rameswar Pratap (IIIT Hyderabad) |
| Details | : | Wed, 15 Mar, 2017 12:00 PM @ BSB 361 |
| Abstract: | : | Frequent Itemset Mining is one of the most well known techniques to extract knowledge from data. The Apriori algorithm is a classical algorithm for the frequent itemset mining problem. A significant bottleneck in Apriori is the number of I/O operation involved, and the number of candidates it generates. In our work, we investigate the role of LSH techniques to overcome these problems, without adding much computational overhead. We propose randomized variations of Apriori that are based on asymmetric LSH defined over Jaccard similarity and Hamming distance. |
