Simpler core vector machines with enclosing balls

ACM International Conference Proceeding Series

Volumn 227, Issue , 2007, Pages 911-918

  Tsang, Ivor W ^a   Kocsor, Andras ^b   Kwok, James T ^a  

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

^b UNIVERSITY OF SZEGED   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; GAUSSIAN DISTRIBUTION; PROBLEM SOLVING; SUPPORT VECTOR MACHINES;

CORE VECTOR MACHINE (CVM); KERNEL METHODS; MINIMUM ENCLOSING BALL (MEB);

SCALING LAWS;

EID: 34547989245     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273496.1273611     Document Type: Conference Paper

References (16)

1. Asharaf, S., Murty, M., & Shevade, S. (2006). Cluster based core vector machine. Proceedings of the Sixth International Conference on Data Mining (pp. 1038-1042).
2. Bordes, A., Ertekin, S., Weston, J., & Bottou, L. (2005). Fast kernel classifiers with online and active learning. Journal of Machine Learning Research, 6, 1579-1619.
3. Chapelle, O. (2007). Training a support vector machine in the primal. Neural Computation, 19, 1155-1178.
4. Crammer, K., Dekel, O., Keshet, J., Shalev-Shwartz, S., & Singer, Y. (2006). Online passive-aggressive algorithms. Journal of Machine Learning Research, 7, 551-585.
5. Har-Peled, S., Roth, D., & Zimak, D. (2007). Maximum margin coresets for active and noise tolerant learning. Proceedings of International Joint Conference on Artificial Intelligence (pp. 836-841).
6. Joachims, T. (2006). Training linear SVMs in linear time. Proceedings of the International Conference on Knowledge Discovery and Data Mining (pp. 217-226).
7. Kumar, P., Mitchell, J., & Yildirim, A. (2003). Approximate minimum enclosing balls in high dimensions using coresets. ACM Journal of Experimental Algorithmics, 8.
8. Nock, R., & Nielsen, F. (2005). Fitting the smallest enclosing Bregman ball. Proceedings of the 16th European Conference on Machine Learning (pp. 649-656).
9. Osuna, E., Freund, R., & Girosi, F. (1997). An improved training algorithm for support vector machines. Proceedings of the IEEE Workshop on Neural Networks for Signal Processing (pp. 276-285).
10. Panigrahy, R. (2004). Minimum enclosing polytope in high dimensions. CoRR cs.CG/0407020.
11. Shevade, S., & Chu, W. (2006). Minimum enclosing spheres formulations for support vector ordinal regression. Proceedings of the Sixth International Conference on Data Mining (pp. 1054-1058).
12. Sonnenburg, S., Rätsch, G., Schäfer, C., & Schölkopf, B. (2006). Large scale multiple kernel learning. Journal of Machine Learning Research, 7, 1531-1565.
13. Tsang, I. W., & Kwok, J. T. (2007). Large-scale sparsified manifold regularization. Advances in Neural Information Processing Systems 19. Cambridge, MA: MIT Press.
14. Tsang, I. W., Kwok, J. T., & Cheung, P.-M. (2005a). Core vector machines: Fast SVM training on very large data sets. Journal of Machine Learning Research, 6, 363-392.
15. Tsang, I. W., Kwok, J. T., & Lai, K. T. (2005b). Core vector regression for very large regression problems. Proceedings of the Twenty-Second International Conference on Machine Learning (pp. 913-920).
16. Vishwanathan, S., Smola, A., & Murty, M. (2003). SimpleSVM. Proceedings of the Twentieth International Conference on Machine Learning (pp. 760-767).