On using prototype reduction schemes to optimize dissimilarity-based classification
From MaRDI portal
Publication:2643878
DOI10.1016/j.patcog.2007.03.006zbMath1123.68113OpenAlexW2122135337WikidataQ60327942 ScholiaQ60327942MaRDI QIDQ2643878
Publication date: 27 August 2007
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2007.03.006
dissimilarity representationdissimilarity-based classificationmahalanobis distances (MDS)prototype reduction schemes (PRSS)
Related Items (3)
A memetic algorithm for evolutionary prototype selection: A scaling up approach ⋮ IFS-CoCo: instance and feature selection based on cooperative coevolution with nearest neighbor rule ⋮ On using prototype reduction schemes to enhance the computation of volume-based inter-class overlap measures
Uses Software
Cites Work
- Enhancing prototype reduction schemes with LVQ3-type algorithms
- On using prototype reduction schemes to optimize kernel-based nonlinear subspace methods.
- Prototype selection for dissimilarity-based classifiers
- The Dissimilarity Representation for Pattern Recognition
- Finding Prototypes For Nearest Neighbor Classifiers
- Nearest prototype classifier designs: An experimental study
- Dissimilarity representations allow for building good classifiers
- Unnamed Item
- Unnamed Item
This page was built for publication: On using prototype reduction schemes to optimize dissimilarity-based classification