Fast Pattern Selection for Support Vector Classifiers
Authors:
- 30 April 2003
- book chapter
- Published by Springer Nature
- p. 376-387
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Termination conditions for a fast k-nearest neighbor method2003
- SVM-KM: speeding SVMs learning with a priori cluster selection and k-means2002
- Pattern Selection for Support Vector Classifiers2002
- The training of neural classifiers with condensed datasetsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2002
- Evaluation of prototype learning algorithms for nearest-neighbor classifier in application to handwritten character recognitionPattern Recognition, 2001
- Sample selection via clustering to construct support vector-like classifiersIEEE Transactions on Neural Networks, 1999
- An optimal algorithm for approximate nearest neighbor searching fixed dimensionsJournal of the ACM, 1998
- Support vector machinesIEEE Intelligent Systems and their Applications, 1998
- Fast implementations of nearest neighbor classifiersPattern Recognition, 1997
- The optimal distance measure for nearest neighbor classificationIEEE Transactions on Information Theory, 1981