Nearest neighbor classifiers are one of most common techniques for classification and ATR applications. Hastie and Tibshirani propose a discriminant adaptive nearest neighbor (DANN) rule for computing a distance metric locally so that posterior probabilities tend to be homogeneous in the modified neighborhoods. The idea is to enlongate or constrict the neighborhood along the direction that is parallel or perpendicular to the decision boundary between two classes. DANN morphs a neighborhood in a linear fashion. In this paper, we extend it to the nonlinear case using the kernel trick. We demonstrate the efficacy of our kernel DANN in the context of ATR applications using a number of data sets.
|Number of pages||11|
|Journal||Proceedings of SPIE - The International Society for Optical Engineering|
|State||Published - 10 Nov 2005|
|Event||Automatic Target Recognition XV - Orlando, FL, United States|
Duration: 29 Mar 2005 → 31 Mar 2005
- Kernel methods
- Nearest neighbors