The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Multiclass multiple kernel learning
Open accessAbstract
In many applications it is desirable to learn from several kernels. "Multiple kernel learning" (MKL) allows the practitioner to optimize over linear combinations of kernels. By enforcing sparse coefficients, it also generalizes feature selection to kernel selection. We propose MKL for joint feature maps. This provides a convenient and principled way for MKL with multiclass problems. In addition, we can exploit the joint feature map to learn kernels on output spaces. We show the equivalence of several different primal formulations including different regularizers. We present several optimization methods, and compare a convex quadratically constrained quadratic program (QCQP) and two semi-infinite linear programs (SILPs) on toy data, showing that the SILPs are faster than the QCQP. We then demonstrate the utility of our method by applying the SILP to three real world datasets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Gaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
Predicting Subcellular Localization of Proteins Based on their N-terminal Amino Acid Sequence
Emanuelsson, O., Nielsen, H., Brunak, S., & von Heijne, G. (2000) · Journal of Molecular Biology · doi:10.1006/jmbi.2000.3903 · Cited by 4,263
Neural Information Processing Systems
(2018) · The Deep Learning Revolution · doi:10.7551/mitpress/11474.003.0014 · Cited by 3,730
Multiple kernel learning, conic duality, and the SMO algorithm
Bach, F. R., Lanckriet, G. R. G., & Jordan, M. I. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015424 · Cited by 1,453
Support vector machine learning for interdependent and structured output spaces
Tsochantaridis, I., Hofmann, T., Joachims, T., & Altun, Y. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015341 · Cited by 1,243
Protein function prediction via graph kernels
Borgwardt, K. M., Ong, C. S., Schonauer, S., Vishwanathan, S. V. N., Smola, A. J., & Kriegel, H.-P. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti1007 · Cited by 1,105
Self-citationSemi-Supervised Classification by Low Density Separation
Chapelle, O., Zien, A., & Ghahramani, R. C. Z. (2005) · Cited by 765
Self-citationGardy, J. L., Laird, M. R., Chen, F., Rey, S., Walsh, C. J., Ester, M., & Brinkman, F. S. L. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti057 · Cited by 718
A statistical framework for genomic data fusion
Lanckriet, G. R. G., De Bie, T., Cristianini, N., Jordan, M. I., & Noble, W. S. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth294 · Cited by 671
Höglund, A., Dönnes, P., Blum, T., Adolph, H.-W., & Kohlbacher, O. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl002 · Cited by 325
Learning the Kernel with Hyperkernels
Ong, C. S., Smola, A. J., Williamson, R. C., & Herbrich, R. (2005) · ANU Open Research (Australian National University) · Cited by 324
Self-citationA general and efficient multiple kernel learning algorithm
Sonnenburg, S., Rätsch, G., & Schäfer, C. (2005) · Max Planck Institute for Plasma Physics · Cited by 146
Optimal kernel selection in Kernel Fisher discriminant analysis
Kim, S.-J., Magnani, A., & Boyd, S. (2006) · International Conference on Machine Learning · doi:10.1145/1143844.1143903 · Cited by 146
Crammer, K., Keshet, J., & Singer, Y. (2002) · Cited by 122
Feature space perspectives for learning the kernel
Micchelli, C. A., & Pontil, M. (2007) · Machine Learning · doi:10.1007/s10994-006-0679-0 · Cited by 49
Cited by
Optimization for Machine Learning
(2011) · The MIT Press eBooks · doi:10.7551/mitpress/8996.001.0001 · Cited by 875
On feature combination for multiclass object classification
Gehler, P., & Nowozin, S. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459169 · Cited by 797
“The authors of [22] derive such a MC-MKL formulation in which all parameters for all classes are trained jointly.”
BackgroundCriminisi, A. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601985415 · Cited by 703
Criminisi, A., Shotton, J., & Konukoglu, E. (2012) · Foundations and Trends® in Computer Graphics and Vision · doi:10.1561/0600000035 · Cited by 677
“Abundant literature has shown the advantage of fusing together multiple simple learners of different types [62, 96, 104, 110, 113].”
BackgroundRen, Y., Zhang, L., & Suganthan, P. N. (2016) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2015.2471235 · Cited by 675
Metadata
- Authors
- Zien, A., & Ong, C. S.
- Venue
- Proceedings of the 24th international conference on Machine learning
- Publisher
- ACM
- Published
- 2007-06-20
- Pages
- 1191-1198
- OpenAlex
- W2106503792
- Cited by
- 266
- References
- 16
- FWCI
- 13.66
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.