Neighborhood Property–Based Pattern Selection for Support Vector Machines
From MaRDI portal
Recommendations
Cites work
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Evaluation of prototype learning algorithms for nearest-neighbor classifier in application to handwritten character recognition
- Fast nearest neighbor search of entropy-constrained vector quantization
- Feasible direction decomposition algorithms for training support vector machines
- Learning changing concepts by exploiting the structure of change
- Multidimensional binary search trees used for associative searching
- The optimal distance measure for nearest neighbor classification
Cited in
(9)- A new parallel data geometry analysis algorithm to select training data for support vector machine
- Embedded feature-selection support vector machine for driving pattern recognition
- Linear boundary discriminant analysis
- Pre-selecting support vectors based on bisection grid
- Scaling the kernel function based on the separating boundary in input space: a data-dependent way for improving the performance of kernel methods
- scientific article; zbMATH DE number 1977840 (Why is no real title available?)
- scientific article; zbMATH DE number 1927194 (Why is no real title available?)
- Online training on a budget of support vector machines using twin prototypes
- Efficient nearest neighbors methods for support vector machines in high dimensional feature spaces
This page was built for publication: Neighborhood Property–Based Pattern Selection for Support Vector Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591521)
