Generalized core vector machines

IEEE Transactions on Neural Networks

Volumn 17, Issue 5, 2006, Pages 1126-1140

  Tsang, Ivor Wai Hung ^b   Kwok, James Tin Yau ^b   Zurada, Jacek M ^a,c  

^a IEEE   (United States)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c University of Louisville   (United States)

Author keywords

Approximation algorithms; Core vector machines (CVMs); Kernel methods; Minimum enclosing ball (MEB); Quadratic programming; Support vector machines (SVMs)

Indexed keywords

CORE VECTOR MACHINES (CVM); DATA SETS; KERNEL METHODS; MINIMUM ENCLOSING BALLS (MEB);

APPROXIMATION ALGORITHMS; DATA ACQUISITION; PROBLEM SOLVING; QUADRATIC PROGRAMMING; REGRESSION ANALYSIS;

SUPPORT VECTOR MACHINES;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; ARTIFICIAL NEURAL NETWORK; AUTOMATED PATTERN RECOGNITION; CLUSTER ANALYSIS; COMPUTER ANALYSIS; METHODOLOGY;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CLUSTER ANALYSIS; COMPUTING METHODOLOGIES; NEURAL NETWORKS (COMPUTER); PATTERN RECOGNITION, AUTOMATED;

EID: 33750095184     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNN.2006.878123     Document Type: Article

References (38)

1. B.Schölkopf and A. Smola, Learning with Kernels. Cambridge, MA: MIT Press, 2002.
2. R. Collobert, S. Bengio, and Y. Bengio, "A parallel mixture of SVMs for very large scale problems," Neural Comput., vol. 14, no. 5, pp. 1105-1114, May 2002.
3. C. Williams and M. Seeger, , T. Leen, T. Dietterich, and V. Tresp, Eds., "Using the Nyström method to speed up kernel machines," in Advances in Neural Information Processing Systems. Cambridge, MA: MIT Press, 2001, vol. 13, pp. 682-688.
4. A. Smola and B. Schölkopf, "Sparse greedy matrix approximation for machine learning," in Proc. 7th Int. Conf. Mach. Learn., Stanford, CA, Jun. 2000, pp. 911-918.
5. D. Achlioptas, F. McSherry, and B. Schölkopf, "Sampling techniques for kernel methods," in Advances in Neural Information Processing Systems, T. Dietterich, S. Becker, and Z. Ghahramani, Eds. Cambridge, MA: MIT Press, 2002, vol. 14, pp. 335-342.
6. S. Fine and K. Scheinberg, "Efficient SVM training using low-rank kernel representations," J. Mach. Learn. Res., vol. 2, pp. 243-264, Dec. 2001.
7. V. Vapnik, Statistical Learning Theory. New York: Wiley, 1998.
8. C.-C. Chang and C.-I. Lin, LIBSVM: A Library for Support Vector Machines 2004 [Online]. Available: http://www.csie.ntu.edu.tw/~cjlin/libsvm
9. E. Osuna, R. Freund, and F. Girosi, "Training support vector machines: An application to face detection," in Proc. Conf. Comput. Vis. Pattern Recognit., San Juan, PR, Jun. 1997, pp. 130-136.
10. J. Platt, , B. Schölkopf, C. Burges, and A. Smola, Eds., "Fast training of support vector machines using sequential minimal optimization," in Advances in Kernel Methods - Support Vector Learning. Cambridge, MA: MIT Press, 1999, pp. 185-208.
11. S. Vishwanathan, A. Smola, and M. Murty, "SimpleSVM," in Proc. 20th Int. Conf. Mach. Learn., Washington, D.C., Aug. 2003, pp. 760-767.
12. N. Takahashi and T. Nishi, "Rigorous proof of termination of SMO algorithm for support vector machines," IEEE Trans. Neural Netw., vol. 16, no. 3, pp. 774-776, May 2005.
13. D. Pavlov, J. Mao, and B. Dom, "Scaling-up support vector machines using boosting algorithm," in Proc. Int. Conf. Pattern Recognit., Barcelona, Spain, Sep. 2000, vol. 2, pp. 2219-2222.
14. Y.-J. Lee and O. Mangasarian, "RSVM: Reduced support vector machines," in Proc. 1st SIAM Int. Conf. Data Mining, San Jose, CA, 2001, pp. 184-200.
15. T. Friess, N. Cristianini, and C. Campbell, "The Kernel-Adatron algorithm: A fast and simple learning procedure for support vector machines," in Proc. 15th Int. Conf. Mach. Learn., Madison, WI, Jul. 1998, pp. 188-196.
16. W. Chu, C. Ong, and S. Keerthi, "An improved conjugate gradient scheme to the solution of least squares SVM," IEEE Trans. Neural Netw., vol. 16, no. 2, pp. 498-501, Mar. 2005.
17. V. Tresp, "Scaling kernel-based systems to large data sets," Data Mining Knowl. Discovery, vol. 5, no. 3, pp. 197-211, 2001.
18. I. W. Tsang, J. T. Kwok, and P.-M. Cheung, "Core vector machines: Fast SVM training on very large data sets," J. Mach. Learn. Res., vol. 6, pp. 363-392, 2005.
19. B. Schölkopf, J. Platt, J. Shawe-Taylor, A. Smola, and R. Williamson, "Estimating the support of a high-dimensional distribution," Neural Comput., vol. 13, no. 7, pp. 1443-1471, Jul. 2001.
20. T. Joachims, "Optimizing search engines using clickthrough data," in Proc. 8th ACM SIGKDD Int. Conf. Knowl. Discovery and Data Mining, Edmonton, AB, Canada, 2002, pp. 133-142.
21. A. Smola and B. Schölkopf, "A tutorial on support vector regression," Stat. Comput., vol. 14, no. 3, pp. 199-222, Aug. 2004.
22. I. W. Tsang, J. T. Kwok, and K. T. Lai, "Core vector regression for very large regression problems," in Proc. 22nd Int. Conf. Mach. Learn., Bonn, Germany, Aug. 2005, pp. 913-920.
23. I. Tsang, J. Kwok, and P.-M. Cheung, "Very large SVM training using core vector machines," in Proc. 10th Int. Workshop Artif. Intell. Stat., Barbados, Jan. 2005, pp. 349-356.
24. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
25. P. Agarwal, S. Har-Peled, and K. Varadarajan, , E. Welzl, Ed., "Geometric approximation via coresets," in Current Trends in Combinatorial and Computational Geometry. Cambridge, U.K.: Cambridge Univ. Press, 2005.
26. M. Bädoiu and K. Clarkson, "Optimal core-sets for balls," presented at the DIMACS Workshop Comput. Geometry, Piscataway, NJ, Nov. 2002.
27. D. Tax and R. Duin, "Support vector domain description," Pattern Recognit. Lett., vol. 20, no. 14, pp. 1191-1199, 1999.
28. S. Har-Peled and Y. Wang, "Shape fitting with outliers," SIAM J. Comput., vol. 33, no. 2, pp. 269-285, 2004.
29. O. Mangasarian and D. Musicant, "Lagrangian support vector machines," J. Mach. Learn. Res., vol. 1, pp. 161-177, 2001.
30. T. Joachims, B. Schölkopf, C. Burges, and A. Smola, Eds., "Making large-scale support vector machine learning practical," in Advances in Kernel Methods - Support Vector Learning. Cambridge, MA: MIT Press, 1999, pp. 169-184.
31. D. Musicant and A. Feinberg, "Active set support vector regression," IEEE Trans. Neural Netw., vol. 15, no. 2, pp. 268-275, Mar. 2004.
32. J. Friedman, "Multivariate adaptive regression splines (with discussion)," Ann. Stat.,vol. 19, no. 1, pp. 1-141, 1991.
33. K.-K. Sung, "Learning and Example Selection for Object and Pattern Recognition," Ph.D. dissertation, Artif. Intell. Lab. and Cntr. Biol. Comput. Learn., MIT, Cambridge, MA, 1996.
34. J. Weston, B. Schölkopf, E. Eskin, C. Leslie, and S. Noble, "Dealing with large diagonals in kernel matrices," in Principles of Data Mining and Knowledge Discovery. Helsinki, Finland: Springer-Verlag, 2002, vol. 243, Lecture Notes in Computer Science, pp. 494-511.
35. A. Bradley, "The use of the area under the ROC curve in the evaluation of machine learning algorithms," Pattern Recognit., vol. 30, no. 7, pp. 1145-1159, 1997.
36. J. Bloomenthal, Introduction to Implicit Surfaces. San Francisco, CA: Morgan Kaufmann, 1997.
37. S. Sonnenburg, G. Rätsch, and B. Schölkopf, "Large scale genomic sequence SVM classifiers," in Proc. 22nd Int. Conf. Mach. Learn., Bonn, Germany, Aug. 2005, pp. 849-856.
38. P. Kumar, J. Mitchell, and A. Yildirim, "Approximate minimum enclosing balls in high dimensions using core-sets," ACM J. Exp. Algorithmics, vol. 8, p. 1.1, Jan. 2003.