On using prototype reduction schemes to optimize kernel-based nonlinear subspace methods.
From MaRDI portal
Publication:1425937
DOI10.1016/j.patcog.2003.07.006zbMath1059.68108OpenAlexW1982606067WikidataQ60328044 ScholiaQ60328044MaRDI QIDQ1425937
Publication date: 14 March 2004
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2003.07.006
Principal component analysisKernel principal component analysisKernel-based nonlinear subspace methodLinear subspace methodPrototype reduction schemes
Related Items (2)
On using prototype reduction schemes to optimize dissimilarity-based classification ⋮ On using prototype reduction schemes to enhance the computation of volume-based inter-class overlap measures
Cites Work
- Enhancing prototype reduction schemes with LVQ3-type algorithms
- Asymptotic quantization error of continuous signals and the quantization dimension
- Finding Prototypes For Nearest Neighbor Classifiers
- Nearest prototype classifier designs: An experimental study
- Fast computation of low rank matrix approximations
- Unnamed Item
- Unnamed Item
This page was built for publication: On using prototype reduction schemes to optimize kernel-based nonlinear subspace methods.