On the Difficulty of Nearest Neighbor Search

First Page		Document Content
Date: 2012-06-12 10:12:20 Data analysis Numerical analysis Summary statistics Nearest neighbor search Locality-sensitive hashing Principal component analysis Normal distribution Curse of dimensionality Supervised learning Statistics Search algorithms Machine learning		On the Difficulty of Nearest Neighbor Search Add to Reading List Source URL: www.sanjivk.com Download Document from Source Website File Size: 246,45 KB Share Document on Facebook

	Principal Component Analysis on non-Gaussian Dependent Data Fang Han Johns Hopkins University, 615 N.Wolfe Street, Baltimore, MDUSA Han Liu Princeton University, 98 Charlton Street, Princeton, NJUSA DocID: 1vdC9 - View Document
	Generalized Principal Component Analysis (GPCA)∗ Ren´e Vidal† Yi Ma‡ Shankar Sastry† † Department of EECS, University of California, Berkeley, CA 94720 DocID: 1uYRE - View Document
	A. Krisciukaitis et al.: Efficiency Evaluation of Autonomic Heart Control by Using the Principal Component Analysis of ECG P-Wave, en 9 en9 Efficiency Evaluation of Autonomic Heart Control by Using DocID: 1tOkO - View Document
	Full Regularization Path for Sparse Principal Component Analysis Alexandre d’Aspremont, Francis Bach & Laurent El Ghaoui, Princeton University, INRIA/ENS Ulm & U.C. Berkeley Support from NSF, DHS and Google. DocID: 1tMMK - View Document
	Binary Principal Component Analysis in the Netflix Collaborative Filtering Task DocID: 1tMJC - View Document