The optimal distance measure for nearest neighbor classification
From MaRDI portal
Publication:3915830
DOI10.1109/TIT.1981.1056403zbMath0464.62047MaRDI QIDQ3915830
Robert D. Short, Keinosuke Fukunaga
Publication date: 1981
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Probabilistic methods, stochastic differential equations (65C99)
Related Items (18)
Generalized k-nearest neighbor rules ⋮ Improving nearest neighbor classification with cam weighted distance ⋮ Error rate estimation by mixture decomposition ⋮ GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING ⋮ Local generalized quadratic distance metrics: application to the \(k\)-nearest neighbors classifier ⋮ Typed topology and its application to data sets ⋮ A weighted \(k\)-nearest neighbor density estimate for geometric inference ⋮ A new nearest neighbor classification algorithm based on local probability centers ⋮ Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms ⋮ Fuzzy neighborhood covering for three-way classification ⋮ Similarity-based inference as evidential reasoning ⋮ Neighborhood Property–Based Pattern Selection for Support Vector Machines ⋮ Concept lattice based composite classifiers for high predictability ⋮ Locally linear metric adaptation with application to semi-supervised clustering and image retrieval ⋮ Relaxational metric adaptation and its application to semi-supervised clustering and content-based image retrieval ⋮ Evaluation of prototype learning algorithms for nearest-neighbor classifier in application to handwritten character recognition ⋮ On kernel difference-weighted \(k\)-nearest neighbor classification ⋮ Weighted locally linear embedding for dimension reduction
This page was built for publication: The optimal distance measure for nearest neighbor classification
