Neighborhood Property–Based Pattern Selection for Support Vector Machines
From MaRDI portal
Publication:3591521
DOI10.1162/neco.2007.19.3.816zbMath1127.68086OpenAlexW1993926867WikidataQ45965495 ScholiaQ45965495MaRDI QIDQ3591521
Publication date: 11 September 2007
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/neco.2007.19.3.816
Related Items (5)
Efficient nearest neighbors methods for support vector machines in high dimensional feature spaces ⋮ A new parallel data geometry analysis algorithm to select training data for support vector machine ⋮ Linear boundary discriminant analysis ⋮ Scaling the kernel function based on the separating boundary in input space: a data-dependent way for improving the performance of kernel methods ⋮ Online training on a budget of support vector machines using twin prototypes
Uses Software
Cites Work
- Learning changing concepts by exploiting the structure of change
- Fast nearest neighbor search of entropy-constrained vector quantization
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- The optimal distance measure for nearest neighbor classification
- Multidimensional binary search trees used for associative searching
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- Evaluation of prototype learning algorithms for nearest-neighbor classifier in application to handwritten character recognition
- Feasible direction decomposition algorithms for training support vector machines
This page was built for publication: Neighborhood Property–Based Pattern Selection for Support Vector Machines