loading...
Automatic Adjustment of Discriminant Adaptive Nearest Neighbor
Hong Kong August 20-August 24
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2006.29418th International Conference on Patt ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Nicolas Delannay, Universite catholique de Louvain (UCL), Belgium
Cedric Archambeau, Universite catholique de Louvain (UCL), Belgium
Michel Verleysen, Universite catholique de Louvain (UCL), Belgium
K-Nearest Neighbors relies on the definition of a global metric. In contrast, Discriminant Adaptive Nearest Neighbor (DANN) computes a different metric at each query point based on a local Linear Discriminant Analysis. In this paper, we propose a technique to automatically adjust the hyper-parameters in DANN by the optimization of two quality criteria. The first one measures the quality of discrimination, while the second one maximizes the local class homogeneity. We use a Bayesian formulation to prevent overfitting.
Citation:
Nicolas Delannay, Cedric Archambeau, Michel Verleysen, "Automatic Adjustment of Discriminant Adaptive Nearest Neighbor," icpr, vol. 2, pp.552-535, 18th International Conference on Pattern Recognition (ICPR'06) Volume 2, 2006
Usage of this product signifies your acceptance of the Terms of Use.