Sciweavers

280 search results - page 3 / 56
» Approximate nearest neighbors using sparse representations
Sort
View
SDM
2007
SIAM
126views Data Mining» more  SDM 2007»
13 years 7 months ago
Nonlinear Dimensionality Reduction using Approximate Nearest Neighbors
Nonlinear dimensionality reduction methods often rely on the nearest-neighbors graph to extract low-dimensional embeddings that reliably capture the underlying structure of high-d...
Erion Plaku, Lydia E. Kavraki
FOCS
1999
IEEE
13 years 10 months ago
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
Martin Farach-Colton, Piotr Indyk
ECCV
2010
Springer
13 years 11 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
ICANN
2005
Springer
13 years 11 months ago
Mutual Information and k-Nearest Neighbors Approximator for Time Series Prediction
This paper presents a method that combines Mutual Information and k-Nearest Neighbors approximator for time series prediction. Mutual Information is used for input selection. K-Nea...
Antti Sorjamaa, Jin Hao, Amaury Lendasse
PRICAI
2010
Springer
13 years 3 months ago
Sparse Representation: Extract Adaptive Neighborhood for Multilabel Classification
Unlike traditional classification tasks, multilabel classification allows a sample to associate with more than one label. This generalization naturally arises the difficulty in cla...
Shuo Xiang, Songcan Chen, Lishan Qiao