Finding Prototypes For Nearest Neighbor Classifiers
From MaRDI portal
Publication:4044169
DOI10.1109/T-C.1974.223827zbMath0292.68044OpenAlexW2019762723MaRDI QIDQ4044169
Publication date: 1974
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/t-c.1974.223827
Related Items (27)
Prototype optimization for nearest-neighbor classification ⋮ On using prototype reduction schemes to optimize dissimilarity-based classification ⋮ GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING ⋮ Fast Nearest Neighbors Search in Graph Space Based on a Branch-and-Bound Strategy ⋮ A class boundary preserving algorithm for data condensation ⋮ ``Anti-Bayesian \textit{parametric} pattern classification using order statistics criteria for some members of the exponential family ⋮ Enhancing prototype reduction schemes with LVQ3-type algorithms ⋮ Automated design of multiple-class piecewise linear classifiers ⋮ Bayesian instance selection for the nearest neighbor rule ⋮ On using prototype reduction schemes to optimize kernel-based nonlinear subspace methods. ⋮ Regularized margin-based conditional log-likelihood loss for prototype learning ⋮ An approach to data reduction and integrated machine classification ⋮ Optimal selection of reference set for the nearest neighbor classification by tabu search ⋮ On using prototype reduction schemes to enhance the computation of volume-based inter-class overlap measures ⋮ Rough-fuzzy weighted \(k\)-nearest leader classifier for large data sets ⋮ Experimental study on prototype optimisation algorithms for prototype-based classification in vector spaces ⋮ A novel gray-based reduced NN classification method ⋮ Evaluation of prototype learning algorithms for nearest-neighbor classifier in application to handwritten character recognition ⋮ Enhancing Density-Based Data Reduction Using Entropy ⋮ Mining competent case bases for case-based reasoning ⋮ Learning prototypes and distances: A prototype reduction technique based on nearest neighbor error minimization ⋮ Prototype reduction schemes applicable for non-stationary data sets ⋮ An efficient prototype merging strategy for the condensed 1-NN rule through class-conditional hierarchical clustering ⋮ Improved \(k\)-nearest neighbor classification ⋮ Optimal reference subset selection for nearest neighbor classification by tabu search ⋮ Learning good prototypes for classification using filtering and abstraction of instances ⋮ Possibilistic instance-based learning
This page was built for publication: Finding Prototypes For Nearest Neighbor Classifiers
