501 search results - page 14 / 101 » Kernel Nearest Neighbor Algorithm |
SODA
2000
ACM
13 years 8 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
ICPR
2010
IEEE
14 years 25 days ago
2010
IEEE
In this paper, a novel approach for contour-based 2D shape recognition is proposed, using a recently introduced class of information theoretic kernels. This kind of kernels, based...
ICPR
2000
IEEE
13 years 12 months ago
2000
IEEE
2. Character Recognition System The paper is about the problem of finding good prototypes for a condensed nearest neighbor classifiei- in a recognition system. A comparison study ...
PAMI
2008
13 years 7 months ago
2008
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
FLAIRS
2008
13 years 9 months ago
2008
The standard kNN algorithm suffers from two major drawbacks: sensitivity to the parameter value k, i.e., the number of neighbors, and the use of k as a global constant that is ind...