A fast iterative nearest point algorithm for support vector machine classifier design

IEEE Transactions on Neural Networks

Volumn 11, Issue 1, 2000, Pages 124-136

  Keerthi, S S ^a   Shevade, S K ^b   Bhattacharyya, C ^b   Murthy, K R K ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Classification; Nearest point algorithm; Quadratic programming; Support vector machine

Indexed keywords

NEAREST POINT ALGORITHMS; SUPPORT VECTOR MACHINES (SVM) CLASSIFIER DESIGN;

ALGORITHMS; ITERATIVE METHODS; QUADRATIC PROGRAMMING;

PATTERN RECOGNITION;

EID: 0033640690     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/72.822516     Document Type: Article

References (29)

1. J. K. Anlauf and M. Biehl, "The adatron: An adaptive perceptron algorithm," Europhys. Lett., vol. 10, no. 7, pp. 687-692, 1989.
2. R. O. Barr, "An efficient computational procedure for a generalized quadratic programming problem," SIAM J. Contr., vol. 7, no. 3, pp. 415-429, 1969.
3. [3 ] R. Bennett and E. J. Bredensteiner, "Geometry in Learning," Dept. Math. Sci., Rennselaer Polytechnic Inst., Troy, NY, Tech. Rep., 1996.
4. R. Bennett and O. L. Mangasarian, "Robust linear programming discrimination of two linearly inseparable sets," Optimization Methods and Software, vol. 1, pp. 23-34, 1992.
5. C. J. C. Burges, "A tutorial on support vector machines for pattern recognition," Data Mining and Knowledge Discovery, vol. 2, no. 2, 1998.
6. C. Cortes and V. Vapnik, "Support vector networks," Machine Learning, vol. 20, pp. 273-297, 1995.
7. R. Fletcher, Practical Methods of Optimization, 2nd ed. New York: Wiley, 1987.
8. T. T. Frieß, N. Cristianini, and C. Campbell, "The kernel adatron algorithm: A fast and simple learning procedure for support vector machines," in Proc. 15th Int. Conf. Machine Learning, San Mateo, CA, 1998.
9. T. T. Frieß, "Support Vector Networks: The Kernel Adatron with Bias and Soft-Margin," Univ. Sheffield, Dept. Automat. Contr. Syst. Eng., Sheffield, U.K., Tech. Rep., 1998.
10. E. G. Gilbert, "Minimizing the quadratic form on a convex set," SIAM J. Contr., vol. 4, pp. 61-79, 1966.
11. E. G. Gilbert, D. W. Johnson, and S. S. Keerthi, "A fast procedure for computing the distance between complex objects in three dimensional space," IEEE J. Robot. Automat., vol. 4, pp. 193-203, 1988.
12. T. Joachims, "Making large-scale support vector machine learning practical," in Advances in Kernel Methods: Support Vector Machines, B. Schölkopf, C. Burges, and A. Smola, Eds. Cambridge, MA: MIT Press, Dec. 1998.
13. L. Kaufman, "Solving the quadratic programming problem arising in support vector classification," in Advances in Kernel Methods: Support Vector Machines, B. Schölkopf, C. Burges, and A. Smola, Eds. Cambodge, MA: MIT Press, Dec. 1998.
14. S. S. Keerthi, S. K. Shevade, C. Bhattacharyya, and K. R. K. Murthy. (1999, Mar.) A Fast Iterative Nearest Point Algorithm for Support Vector Machine Classifier Design. Intell. Syst. Lab., Dept. Comput. Sci. Automat., Indian Inst. Sci., Bangalore, Karnataka, India. [Online]. Available: http://guppy.mpe.nus.edu.sg/∼mpessk
15. C. L. Lawson and R. J. Hanson, Solving Least Squares Problems. Englewood Cliffs, NJ: Prentice-Hall, 1974.
16. S. R. Lay, Convex Sets and Their Applications. New York: Wiley, 1982.
17. V. J. Lumelsky, "On fast computation of distance between line segments," Inform. Processing Lett., vol. 21, pp. 55-61, 1985.
18. B. F. Mitchell, V. F. Dem'yanov, and V. N. Malozemov, "Finding the point of a polyhedron closest to the origin," SIAM J. Contr., vol. 12, pp. 19-26, 1974.
19. O. L. Mangasarian and D. R. Musicant, "Successive Overrelaxation for Support Vector Machines," Computer Sciences Dept., University of Wisconsin, Madison, WI, Tech. Rep., 1998.
20. J. C. Platt, "Fast training of support vector machines using sequential minimal optimization," in Advances in Kernel Methods: Support Vector Machines, B. Schölkopf, C. Burges, and A. Smola, Eds. Cambridge, MA: MIT Press, Dec. 1998.
21. Adult and Web Datasets, J. C. Platt. [Online]. Available: http://www.research.microsoft.com/∼jplatt
22. N. K. Sancheti and S. S. Keerthi, "Computation of certain measures of proximity between convex polytopes: A complexity viewpoint," in Proc. IEEE Int. Conf. Robot. Automat., Nice, France, 1992, pp. 2508-2513.
23. A. J. Smola and B. Schölkopf, "A Tutorial on Support Vector Regression," Royal Holloway College, London, U.K., NeuroCOLT Tech. Rep. TR-1998-030, 1998.
24. Two Spirals Data [Online]. Available: ftp://ftp.boltz.cs.cmu.edu/ pub/neural-bench/bench/two-spirals-v1.0.tar.gz
25. UCI Machine Learning Repository [Online]. Available: http://www.ics.uci. edu/∼mlearn/MLRepository.html
26. V. Vapnik, Estimation of Dependences Based on Empirical Data. Berlin, Germany: Springer-Verlag, 1982.
27. V. Vapnik, The Nature of Statistical Learning Theory. New York: Springer-Verlag, 1995.
28. Wisconsin Breast Cancer Data [Online]. Available: ftp://128.195.1.46/pub/machine-learning-databases/breast-cancer-wisconsin/
29. P. Wolfe, "Finding the nearest point in a polytope," Math. Programming, vol. 11, pp. 128-149, 1976.