Sharing hash codes for multiple purposes
From MaRDI portal
Publication:2329853
DOI10.1007/s42081-018-0010-xzbMath1430.62274arXiv1609.03219OpenAlexW2542631592MaRDI QIDQ2329853
Wiktor Pronobis, Vignesh Srinivasan, Klaus-Robert Müller, Danny Panknin, Wojciech Samek, Shinichi Nakajima, Johannes Kirschnick, Volker Markl, Manohar Kaul
Publication date: 18 October 2019
Published in: Japanese Journal of Statistics and Data Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.03219
information retrievalcollaborative filteringlocality sensitive hashingapproximate near neighbor search
Applications of statistics in engineering and industry; control charts (62P30) Statistical aspects of big data and data science (62R07)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lectures on analysis on metric spaces
- Learning Deep Architectures for AI
- Similarity estimation techniques from rounding algorithms
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Locality-sensitive hashing scheme based on p-stable distributions
- The elements of statistical learning. Data mining, inference, and prediction