Support vector machine classification for large data sets via minimum enclosing ball clustering
Authors:
- Jair CervantesJCJair Cervantes
- Xiaoou LiXLXiaoou Li
- Wen YuWYWen Yu
- Kang LiKLKang Li
- 1 January 2008
- journal article
- Published by Elsevier in Neurocomputing
- Vol. 71 (4-6) , 611-619
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- GP ensembles for large-scale data classificationIEEE Transactions on Evolutionary Computation, 2006
- A Study on SMO-Type Decomposition Methods for Support Vector MachinesIEEE Transactions on Neural Networks, 2006
- Support-vector-based fuzzy neural network for pattern classificationIEEE Transactions on Fuzzy Systems, 2006
- Fast Modular Network Implementation for Support Vector MachinesIEEE Transactions on Neural Networks, 2005
- Fast SVM training algorithm with decomposition on very large data setsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2005
- Enhancing Prototype Reduction Schemes With Recursion: A Method Applicable for “Large” Data SetsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2004
- Approximate minimum enclosing balls in high dimensions using core-setsACM Journal of Experimental Algorithmics, 2003
- Approximate clustering via core-sets2002
- Successive overrelaxation for support vector machinesIEEE Transactions on Neural Networks, 1999
- A comparative study of ordinary cross-validation, v-fold cross-validation and the repeated learning-testing methodsBiometrika, 1989