Frequent-itemset mining using locality-sensitive hashing

DOI10.1007/978-3-319-42634-1_12MaRDI QIDQ2817857zbMATH OpenOpenAlexFDO

Authors Debajyoti Bera, Rameshwar Pratap

Publication date 2 September 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1603.01682

Mathematics Subject Classification ID

Randomized algorithms (68W20) Database theory (68P15)

Abstract: 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. 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 Hamming distance and Jaccard similarity.

Recommendations

• scientific article; zbMATH DE number 5967649
• Integration of candidate hash trees in concurrent processing of frequent itemset queries using Apriori
• An improved algorithm based on sets operation for mining frequent itemsets
• A lattice-based approach for I/O efficient association rule mining.
• scientific article; zbMATH DE number 1950581

Cites work

• scientific article; zbMATH DE number 1775450 (Why is no real title available?)
• Frequent-itemset mining using locality-sensitive hashing
• Locality-sensitive hashing without false negatives
• Min-wise independent permutations

Cited in

(4)

• scientific article; zbMATH DE number 2087753 (Why is no real title available?)
• Frequent-itemset mining using locality-sensitive hashing
• Integration of candidate hash trees in concurrent processing of frequent itemset queries using Apriori
• Index structures for fast similarity search for binary vectors

This page was built for publication: Frequent-itemset mining using locality-sensitive hashing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817857)