NDLI: Spectral Approaches to Nearest Neighbor Search

Content Provider	IEEE Xplore Digital Library
Author	Abdullah, A. Andoni, A. Kannan, R. Krauthgamer, R.
Copyright Year	2014
Abstract	We study spectral algorithms for the high-dimensional Nearest Neighbor Search problem (NNS). In particular, we consider a semi-random setting where a dataset is chosen arbitrarily from an unknown subspace of low dimension, and then perturbed by full-dimensional Gaussian noise. We design spectral NNS algorithms whose query time depends polynomially on the dimension and logarithmically on the size of the point set. These spectral algorithms use a repeated computation of the top PCA vector/subspace, and are effective even when the random-noise magnitude is much larger than the interpoint distances. Our motivation is that in practice, a number of spectral NNS algorithms outperform the random-projection methods that seem otherwise theoretically optimal on worst-case datasets. In this paper we aim to provide theoretical justification for this disparity. The full version of this extended abstract is available on arXiv.
Sponsorship	IEEE Comput. Soc. Tech. Comm. Math. Found. Comput.
Starting Page	581
Ending Page	590
File Size	337714
Page Count	10
File Format	PDF
ISBN	9781479965175
ISSN	02725428
DOI	10.1109/FOCS.2014.68
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-10-18
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Principal component analysis Noise Algorithm design and analysis Vectors Partitioning algorithms Data structures Nearest neighbor searches spectral algorithms Nearest neighbor search
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A fast nearest neighbor search algorithm by nonlinear embedding

Novel approach for nearest neighbor search in high dimensional space

Acceleration of the LBG algorithm

Quantization based nearest-neighbor-preserving metric approximation

Density connected clustering with local subspace preferences

The Approach of Adaptive Spectral Clustering Analyze on High Dimensional Data

Fast Audio Fingerprint Search Strategy for Song Identification

P3C: A Robust Projected Clustering Algorithm

Effective nearest neighbor search for aligning and merging range images

Spectral Approaches to Nearest Neighbor Search

Similar Documents

A fast nearest neighbor search algorithm by nonlinear embedding

Novel approach for nearest neighbor search in high dimensional space

Acceleration of the LBG algorithm

Quantization based nearest-neighbor-preserving metric approximation

Density connected clustering with local subspace preferences

The Approach of Adaptive Spectral Clustering Analyze on High Dimensional Data

Fast Audio Fingerprint Search Strategy for Song Identification

P3C: A Robust Projected Clustering Algorithm

Effective nearest neighbor search for aligning and merging range images

Spectral Approaches to Nearest Neighbor Search