280 search results - page 5 / 56 » Approximate nearest neighbors using sparse representations |
PRL
2002
14 years 9 months ago
2002
In this paper, a classification task on dissimilarity representations is considered. A traditional way to discriminate between objects represented by dissimilarities is the neares...
127
click to vote
VLSISP
2010
14 years 8 months ago
2010
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
173
click to vote
ICDE
2002
IEEE
15 years 11 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
NIPS
2007
14 years 11 months ago
2007
Rare category detection is an open challenge for active learning, especially in the de-novo case (no labeled examples), but of significant practical importance for data mining - ...
113
click to vote
Publication
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...