Very large SVM training using Core Vector Machines

AISTATS 2005 - Proceedings of the 10th International Workshop on Artificial Intelligence and Statistics

Volumn , Issue , 2005, Pages 349-356

  Tsang, Ivor W ^a   Kwok, James T ^a   Cheung, Pak Ming ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

CORE SET; DATA SETS; GAUSSIAN KERNELS; KERNEL METHODS; MINIMUM ENCLOSING BALL; OPTIMAL SOLUTIONS; REAL WORLD DATA; SCALE-UP; SPACE COMPLEXITY; TIME COMPLEXITY; TRAINING SETS; VECTOR MACHINES;

COMPUTATIONAL GEOMETRY; VIRTUAL REALITY;

ARTIFICIAL INTELLIGENCE;

EID: 33947417485     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Bǎdoiu, M., & Clarkson, K. (2002). Optimal core-sets for balls. DIMACS Workshop on Computational Geometry.
2. Cauwenberghs, G., & Poggio, T. (2001). Incremental and decremental support vector machine learning. Advances in Neural Information Processing Systems 13. Cambridge, MA: MIT Press.
3. Chang, C.-C., & Lin, C.-J. (2004). LIBSVM: a library for support vector machines. Software available at http://www.csie.ntu.edu.tw/~cjlin/libsvm.
4. Chapelle, O., Vapnik, V., Bousquet, O., & Mukherjee, S. (2002). Choosing multiple parameters for support vector machines. Machine Learning, 46, 131-159.
5. Collobert, R., Bengio, S., & Bengio, Y. (2002). A parallel mixture of SVMs for very large scale problems. Neural Computation, 14, 1105-1114.
6. Fine, S., & Scheinberg, K. (2001). Efficient SVM training using low-rank kernel representation. Journal of Machine Learning Research, 2, 243-264.
7. Garey, M., & Johnson, D. (1979). Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman.
8. Joachims, T. (1999). Making large-scale support vector machine learning practical. In B. Schölkopf, C. Burges and A. Smola (Eds.), Advances in kernel methods - Support vector learning, 169-184. Cambridge, MA: MIT Press.
9. Kumar, P., Mitchell, J., & Yildirim, A. (2003). Approximate minimum enclosing balls in high dimensions using core-sets. ACM Journal of Experimental Algorithmics, 8.
10. Lee, Y.-J., & Mangasarian, O. (2001). RSVM: Reduced support vector machines. Proceeding of the First SIAM International Conference on Data Mining.
11. Lin, K.-M., & Lin, C.-J. (2003). A study on reduced support vector machines. IEEE Transactions on Neural Networks, 14, 1449-1459.
12. Mangasarian, O., & Musicant, D. (2001). Lagrangian support vector machines. Journal of Machine Learning Research, 1, 161-177.
13. Osuna, E., Freund, R., & Girosi, F. (1997). Training support vector machines: an application to face detection. Proceedings of Computer Vision and Pattern Recognition (pp. 130-136). San Juan, Puerto Rico.
14. Platt, J. (1999). Fast training of support vector machines using sequential minimal optimization. In B. Schölkopf, C. Burges and A. Smola (Eds.), Advances in kernel methods - support vector learning, 185-208. Cambridge, MA: MIT Press.
15. Schölkopf, B., Platt, J., Shawe-Taylor, J., Smola, A., & Williamson, R. (2001). Estimating the support of a high-dimensional distribution. Neural Computation, 13, 1443-1471.
16. Smola, A., & Schölkopf, B. (2000). Sparse greedy matrix approximation for machine learning. Proceedings of the Seventeenth International Conference on Machine Learning (pp. 911-918). Standord, CA, USA.
17. Smola, A., & Schölkopf, B. (2004). A tutorial on support vector regression. Statistics and Computing, 14, 199-222.
18. Tax, D., & Duin, R. (1999). Support vector domain description. Pattern Recognition Letters, 20, 1191-1199.
19. Vishwanathan, S., Smola, A., & Murty, M. (2003). SimpleSVM. Proceedings of the Twentieth International Conference on Machine Learning (pp. 760-767). Washington, D.C., USA.
20. Williams, C., & Seeger, M. (2001). Using the Nyström method to speed up kernel machines. Advances in Neural Information Processing Systems 13. Cambridge, MA: MIT Press.