Chrome Extension
WeChat Mini Program
Use on ChatGLM

Automatic Adjustment of Discriminant Adaptive Nearest Neighbor

Pattern Recognition, 2006 ICPR 2006 18th International Conference

Cited 1|Views0
No score
Abstract
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.
More
Translated text
Key words
Discriminant Adaptive Nearest Neighbor,local Linear Discriminant Analysis,local class homogeneity,quality criterion,Bayesian formulation,K-Nearest Neighbors,query point,Automatic Adjustment
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined