Improving the k-NCN classification rule through heuristic modifications

DOI10.1016/S0167-8655(98)00108-1MaRDI QIDQ4226541zbMATH OpenOpenAlexFDO

Authors

Publication date 27 January 1999

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8655(98)00108-1

zbMATH Keywords

\(k\)-nearest centroid Neighbours

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• Artificial Intelligence and Soft Computing - ICAISC 2004
• Improved \(k\)-nearest neighbor classification
• scientific article; zbMATH DE number 1567946
• Adaptive soft \(k\)-nearest-neighbour classifiers
• Choice of the smoothing parameter and efficiency of k-nearest neighbor classification

Cited in

(3)

• Artificial Intelligence and Soft Computing - ICAISC 2004
• Prototype selection for dissimilarity-based classifiers
• GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING

This page was built for publication: Improving the k-NCN classification rule through heuristic modifications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4226541)