Frequent-Itemset Mining Using Locality-Sensitive Hashing

DOI10.1007/978-3-319-42634-1_12zbMath1476.68071arXiv1603.01682OpenAlexW2301752323MaRDI QIDQ2817857

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

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

Related Items (2)

Index structures for fast similarity search for binary vectors ⋮ Frequent-Itemset Mining Using Locality-Sensitive Hashing

Cites Work

• Unnamed Item
• Min-wise independent permutations
• Frequent-Itemset Mining Using Locality-Sensitive Hashing
• Locality-sensitive Hashing without False Negatives

This page was built for publication: Frequent-Itemset Mining Using Locality-Sensitive Hashing