An efficient prototype merging strategy for the condensed 1-NN rule through class-conditional hierarchical clustering

DOI10.1016/S0031-3203(01)00208-4zbMath1007.68944OpenAlexW2150800840MaRDI QIDQ1856699

Francesc J. Ferri, Ramón A. Mollineda, Enrique Vidal

Publication date: 11 February 2003

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

Full work available at URL: https://doi.org/10.1016/s0031-3203(01)00208-4

zbMATH Keywords

nearest neighborclass-conditional hierarchical clusteringcluster-based condensingprototype merging

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)

Related Items (3)

Rough-fuzzy weighted \(k\)-nearest leader classifier for large data sets ⋮ Learning prototypes and distances: A prototype reduction technique based on nearest neighbor error minimization ⋮ Prototype selection for dissimilarity-based classifiers

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Reduction techniques for instance-based learning algorithms
• A Survey of Recent Advances in Hierarchical Clustering Algorithms
• Finding Prototypes For Nearest Neighbor Classifiers
• Asymptotic Properties of Nearest Neighbor Rules Using Edited Data

This page was built for publication: An efficient prototype merging strategy for the condensed 1-NN rule through class-conditional hierarchical clustering