Jump to : Download | Note | Abstract | Contact | BibTex reference | EndNote reference |

NNSearchDifficulty:icml2012

Junfeng He, Sanjiv Kumar, Shih-Fu Chang. On the Difficulty of Nearest Neighbor Search. In International Conference on Machine Learning (ICML), Edinburgh, Scotland, 2012.

Download [help]

Download paper: Adobe portable document (pdf)

Copyright notice:This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Note on this paper

Supplementary material available here

Abstract

Fast approximate nearest neighbor(NN) search in large databases is becoming popular. Several powerful learning-based formulations have been proposed recently. However, not much attention has been paid to a more fundamental question: how difficult is (approximate) nearest neighbor search in a given data set? And which data properties affect the difficulty of nearest neighbor search and how? This paper introduces the first concrete measure called Relative Contrast that can be used to evaluate the influence of several crucial data characteristics such as dimensionality, sparsity, and database size simultaneously in arbitrary normed metric spaces. Moreover, we present a theoretical analysis to prove how the difficulty measure (relative contrast) determines/affects the complexity of Local Sensitive Hashing, a popular approximate NN search method. Relative contrast also provides an explanation for a family of heuristic hashing algorithms with good practical performance based on PCA. Finally, we show that most of the previous works in measuring NN search meaningfulness/difficulty can be derived as special asymptotic cases for dense vectors of the proposed measure

Contact

Junfeng He
Shih-Fu Chang

BibTex Reference

@InProceedings{NNSearchDifficulty:icml2012,
   Author = {He, Junfeng and Kumar, Sanjiv and Chang, Shih-Fu},
   Title = {On the Difficulty of Nearest Neighbor Search},
   BookTitle = {International Conference on Machine Learning (ICML)},
   Address = {Edinburgh, Scotland},
   Year = {2012}
}

EndNote Reference [help]

Get EndNote Reference (.ref)

 
bar

For problems or questions regarding this web site contact The Web Master.

This document was translated automatically from BibTEX by bib2html (Copyright 2003 © Eric Marchand, INRIA, Vista Project).