Optimization of k nearest neighbor density estimates

Authors:
K. Fukunaga;L. Hostetler
Affiliations:
-;-
Venue:
IEEE Transactions on Information Theory
Year:
1973

Citing 0
Cited 8

Locally linear metric adaptation with application to semi-supervised clustering and image retrieval

Pattern Recognition
Non-parametric classifier-independent feature selection

Pattern Recognition
Relaxational metric adaptation and its application to semi-supervised clustering and content-based image retrieval

Pattern Recognition
Weighted locally linear embedding for dimension reduction

Pattern Recognition
A class discriminality measure based on feature space partitioning

Pattern Recognition
Kernel-based metric learning for semi-supervised clustering

Neurocomputing
Application of classification techniques on development an early-warning system for chronic illnesses

Expert Systems with Applications: An International Journal
A training sample sequence planning method for pattern recognition problems

Automatica (Journal of IFAC)

Quantified Score

Hi-index	754.84

Visualization

Abstract

Nonparametric density estimation using thek-nearest-neighbor approach is discussed. By developing a relation between the volume and the coverage of a region, a functional form for the optimumkin terms of the sample size, the dimensionality of the observation space, and the underlying probability distribution is obtained. Within the class of density functions that can be made circularly symmetric by a linear transformation, the optimum matrix for use in a quadratic form metric is obtained. For Gaussian densities this becomes the inverse covariance matrix that is often used without proof of optimality. The close relationship of this approach to that of Parzen estimators is then investigated.