Hashing Hyperplane Queries to Near Points with Applications to Large-Scale Active Learning

Abstract

We consider the problem of retrieving the database points nearest to a given hyperplane query without exhaustively scanning the entire database. For this problem, we propose two hashing-based solutions. Our first approach maps the data to 2-bit binary keys that are locality sensitive for the angle between the hyperplane normal and a database point. Our… (More)
DOI: 10.1109/TPAMI.2013.121

Topics

4 Figures and Tables

Statistics

0102020112012201320142015201620172018
Citations per Year

93 Citations

Semantic Scholar estimates that this publication has 93 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Jain2010HashingHQ, title={Hashing Hyperplane Queries to Near Points with Applications to Large-Scale Active Learning}, author={Prateek Jain and Sudheendra Vijayanarasimhan and Kristen Grauman}, journal={IEEE Transactions on Pattern Analysis and Machine Intelligence}, year={2010}, volume={36}, pages={276-288} }