Machine Learning using Hyperkernels

Proceedings, Twentieth International Conference on Machine Learning

Volumn 2, Issue , 2003, Pages 568-575

  Ong, Cheng Soon ^a   Smola, Alexander J ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; DATA REDUCTION; LAGRANGE MULTIPLIERS; MATRIX ALGEBRA; PROBLEM SOLVING; VECTORS;

BINARY CLASSIFICATION; DATASETS; HYPERKERNELS; KERNEL FUNCTIONS;

LEARNING SYSTEMS;

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

References (21)

1. Albert, A. (1969). Conditions for positive and nonnegative definiteness in terms of pseudoinverses. SIAM Journal on Applied Mathematics, 17, 434-440.
2. Bennett, K. P., & Mangasarian, O. L. (1992). Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, 1, 23-34.
3. Bousquet, O., & Herrmann, D. (2003). On the complexity of learning the kernel matrix. Advances in Neural Information Processing Systems 15.
4. Cortes, C., & Vapnik, V. (1995). Support vector networks. Machine Learning, 20, 273-297.
5. Crammer, K., Keshet, J., & Singer, Y. (2003). Kernel design using boosting. Advances in Neural Information Processing Systems 15.
6. Cristianini, N., Shawe-Taylor, J., Elisseeff, A., & Kandola, J. (2002). On kernel-target alignment. Advances in Neural Information Processing Systems 14 (pp. 367-373). Cambridge, MA: MIT Press.
7. Fine, S., & Scheinberg, K. (2000). Efficient SVM training using low-rank kernel representation (Technical Report). IBM Watson Research Center, New York.
8. Freund, Y., & Schapire, R. E. (1996). Experiments with a new boosting algorithm. Proceedings of the International Conference on Machine Learing (pp. 148-146). Morgan Kaufmann Publishers.
9. Haussler, D. (1999). Convolutional kernels on discrete structures (Technical Report UCSC-CRL-99-10). Computer Science Department, UC Santa Cruz.
10. Lanckriet, G., Cristianini, N., Bartlett, P., Ghaoui, L. E., & Jordan, M. (2002). Learning the kernel matrix with semidefinite programming. Proceedings of the International Conference on Machine Learning (pp. 323-330). Morgan Kaufmann.
11. MacKay, D. J. C. (1994). Bayesian non-linear modelling for the energy prediction competition. American Society of Heating, Refrigerating and Air-Conditioning Engineers Transcations, 4, 448-472.
12. Mangasarian, O. L., & Musicant, D. R. (2001). Lagrangian support vector machines. Journal of Machine Learning Research, 1, 161-177. http://www.jmlr.org.
13. Meyer, D., Leisch, F., & Hornik, K. (2003). The support vector machine under test. Neurocomputing. Forthcoming.
14. Momma, M., & Bennett, K. P. (2002). A pattern search method for model selection of support vector regression. Proceedings of the Second SIAM International Conference on Data Mining.
15. Ong, C. S., Smola, A. J., & Williamson, R. C. (2003). Hyperkernels. Advances in Neural Information Processing Systems 15.
16. Opper, M., & Winther, O. (2000). Gaussian processes and SVM: Mean field and leave-one-out. Advances in Large Margin Classifiers (pp. 311-326). Cambridge, MA: MIT Press.
17. Rätsch, G., Onoda, T., & Müller, K. R. (2001). Soft margins for adaboost. Machine Learning, 42, 287-320.
18. Schölkopf, B., Platt, J., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (2001). Estimating the support of a high-dimensional distribution. Neural Computation, 13, 1443-1471.
19. Schölkopf, B., Smola, A., Williamson, R. C., & Bartlett, P. L. (2000). New support vector algorithms. Neural Computation, 12, 1207-1245.
20. Vandenberghe, L., & Boyd, S. (1996). Semidefinite programming. SIAM Review., 38, 49-95.
21. Zhang, T. (2001). Some sparse approximation bounds for regression problems. Proc. 18th International Conf. on Machine Learning (pp. 624-631). Morgan Kaufmann, San Francisco, CA.