Entropy based nearest neighbor search in high dimensions
From MaRDI portal
Publication:3581520
DOI10.1145/1109557.1109688zbMath1192.68217OpenAlexW2953019775MaRDI QIDQ3581520
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.9763
Analysis of algorithms (68W40) Database theory (68P15) Information storage and retrieval of data (68P20)
Related Items (8)
Lower bounds on lattice sieving and information set decoding ⋮ Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny) ⋮ Index structures for fast similarity search for real-valued vectors. I ⋮ GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions ⋮ An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN ⋮ Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem ⋮ An Improved Algorithm Finding Nearest Neighbor Using Kd-trees ⋮ Local Density Estimation in High Dimensions
This page was built for publication: Entropy based nearest neighbor search in high dimensions
