A new iterative algorithm training SVM

Optimization Methods and Software

Volumn 24, Issue 6, 2009, Pages 913-932

  Zhou, Shuisheng ^a   Liu, Hongwei ^a   Ye, Feng ^a   Zhou, Lihua ^a  

^a XIDIAN UNIVERSITY   (China)

Author keywords

Data classification; Descent feasible direction; Maximal margin classifier; Nearest points; Support vector machine

Indexed keywords

COMPUTATIONAL EXPERIMENT; CONVERGENCE PROPERTIES; CONVEX HULL; DATA CLASSIFICATION; DESCENT FEASIBLE DIRECTION; GEOMETRIC INTERPRETATION; ITERATIVE ALGORITHM; MAXIMAL MARGIN CLASSIFIER; NEAREST POINT; NEAREST POINTS; NUMBER OF ITERATIONS; SVM ALGORITHM; TRAINING SETS; TRAINING TIME;

ALGORITHMS; CLASSIFICATION (OF INFORMATION); CLASSIFIERS; COST FUNCTIONS; IMAGE RETRIEVAL; ITERATIVE METHODS; SUPPORT VECTOR MACHINES;

CONVERGENCE OF NUMERICAL METHODS;

EID: 70349629126     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780902867906     Document Type: Article

References (24)

1. K.P. Bennett and E.J. Bredensteiner, Duality and Geometry in SVM Classifiers, in Proceedings of the 17th International Conference on Machine Learning, P. Langley, ed., Morgan Kaufmann, 2000, pp. 57-64.
2. C.-C. Chang and C.-J. Li, Training nu-SupportVector Classifiers: Theory and Algorithms, Neural Comput. 13 (2001), pp. 2119-2147.
3. P.-H. Chen, R.-E. Fan, and C.-J. Lin, A study on smo-type decomposition methods for support vector machines, IEEE Trans. Neural Networks 17 (2006), pp. 893-908.
4. D. Crisp and C. Burges, A Geometric Interpretation of v-SVM Classifiers, In Advances in Neural Information Processing Systems 12, S. A. Solla, T. K. Leen, K.-R. Mller, eds., Cambridge, MA. MIT Press, 2000.
5. R.-E. Fan, P.-H. Chen, and C.-J. Lin,Working set selection using the second-order information for training SVM, J. Mach. Learn. Res. 6 (2005), pp. 1889-1918.
6. V. Franc and V. Hlavàĉ, A Simple Learning Algorithm for Maximal Margin Classifier, in proceedings Workshop on the Kernel and Subspace Methods for Computer Vision ad joint to ICANN, A. Leaonardis and H. Bischof, eds., Austria, 2001, pp. 1-11.
7. V. Franc andV. Hlavàĉ, An iterative algorithm learning the maximal margin classifier, Pattern Recognition 36 (2003), pp. 1985-1996.
8. E.G. Gilbert, Minimizing the quadratic form on a convex set, SIAM J. Control. 4 (1966), pp. 61-79.
9. T.K. Ho, and E.M. Kleinberg, Checkerboard data set,1996. http://www.cs.wisc.edu/math-prog/mpml.html
10. T. Joachims, SVMlight , 1998. http://svmlight.joachims.org/
11. S.S. Keerthi and E.G. Gilbert, Convergence of a generalized SMO algorithm for SVM classifier design,Mach. Learn. 46 (2002), pp. 351-360.
12. S.S. Keerthi, S.K. Shevade, C. Bhattacharyya, and K.R.K. Murthyet, A fast iterative nearest point algorithm for support vector machine classifier design, IEEE Trans. Neural Networks 11 (2000), pp. 124-136.
13. S.S. Keerthi, S.K. Shevade, C. Bhattacharyya, and K.R.K. Murthy, Improvements to Platt's SMO algorithm for SVM classifier design, Neural Comput. 13 (2001), pp. 637-649.
14. C.-J. Lin, On the convergence of the decomposition method for support vector machines, IEEE Trans. Neural Networks 12 (2001), pp. 1288-1298.
15. C.-J. Lin, Asymptotic convergence of an SMO algorithm without any assumptions, IEEE Trans. Neural Networks, 13 (2002), pp.248-250.
16. B.F. Mitchell, V.F. Dem'yanov, and V.N. Malozemov, Finding the point of a polyhedron closet to the origin, SIAM J. Control. 12 (1974), pp. 19-26.
17. J.C. Platt, Fast Training of Support Vector Machines using Sequential Minimal Optimization, in Advances in Kernel Method-Support Vector Learning, B. Schölkopf et al., eds., Cambridge, MA, MIT Press, 1999, pp. 185-208.
18. G. Rätsch, Benchmark Repository. Available at http://ida.first. fraunhofer.de/projects/bench/benchmarks.htm
19. B. Schölkopf, A.J. Smola, R.C.Williamson, and P.L. Bartlett, New support vector algorithms, Neural Computation 12 (2000), pp. 1207-1245.
20. I. Steinwart, On the optimal parameter choice in í-support vector machines, IEEE Trans. Pattern Anal. Mach. Intell. 25 (2003), pp. 1274-1284.
21. N. Takahashi and T. Nishi, Rigorous proof of termination of SMO algorithm for support vector machines, IEEE Trans. Neural Network 16 (2005), pp. 774-776.
22. Q. Tao, G.Wu, and J.Wang, A generalized S-K algorithm for learning í-SVM classifiers, Pattern Recognition Lett. 25 (2004), pp. 1165-1171.
23. V.N. Vapnik, The Nature of Statistical Learning Theory, Springer-Verlag, NewYork, 2000.
24. S.-S. Zhou, H.-W. Liu, and F.Ye, The variant of gaussian kernel and its model selection method, inThird International Conference on Natural Computation, Haikou, China, 2007, August, pp. 683-687.