Sciweavers

58 search results - page 6 / 12
» Adaptive Kernel Metric Nearest Neighbor Classification
Sort
View
ICML
2006
IEEE
14 years 8 months ago
Locally adaptive classification piloted by uncertainty
Locally adaptive classifiers are usually superior to the use of a single global classifier. However, there are two major problems in designing locally adaptive classifiers. First,...
Juan Dai, Shuicheng Yan, Xiaoou Tang, James T. Kwo...
ICML
2007
IEEE
14 years 8 months ago
Information-theoretic metric learning
In this paper, we present an information-theoretic approach to learning a Mahalanobis distance function. We formulate the problem as that of minimizing the differential relative e...
Jason V. Davis, Brian Kulis, Prateek Jain, Suvrit ...
AAAI
1997
13 years 8 months ago
Symbolic Nearest Mean Classifiers
The minimum-distance classifier summarizes each class with a prototype and then uses a nearest neighbor approach for classification. Three drawbacks of the original minimum-distan...
Piew Datta, Dennis F. Kibler
ICPR
2004
IEEE
14 years 8 months ago
Using Adapted Levenshtein Distance for On-Line Signature Authentication
In this paper a new method for on-line signature authentication will be presented, which is based on a event-string modelling of features derived from pen-position and pressure si...
Sascha Schimke, Claus Vielhauer, Jana Dittmann
VLSISP
2010
254views more  VLSISP 2010»
13 years 5 months ago
Manifold Based Local Classifiers: Linear and Nonlinear Approaches
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...
Hakan Cevikalp, Diane Larlus, Marian Neamtu, Bill ...