The DOI matches its Crossref record.
EasyMKL: a scalable multiple kernel learning algorithm
Abstract
The goal of Multiple Kernel Learning (MKL) is to combine kernels derived from multiple sources in a data-driven way with the aim to enhance the accuracy of a target kernel machine. State-of-the-art methods of MKL have the drawback that the time required to solve the associated optimization problem grows (typically more than linearly) with the number of kernels to combine. Moreover, it has been empirically observed that even sophisticated methods often do not significantly outperform the simple average of kernels. In this paper, we propose a time and space efficient MKL algorithm that can easily cope with hundreds of thousands of kernels and more. The proposed method has been compared with other baselines (random, average, etc.) and three state-of-the-art MKL methods showing that our approach is often superior. We show empirically that the advantage of using the method proposed in this paper is even clearer when noise features are added. Finally, we have analyzed how our algorithm changes its performance with respect to the number of examples in the training set and the number of kernels combined.
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
Cited by
Bayoudh, K., Knani, R., Hamdaoui, F., & Mtibaa, A. (2022) · The Visual Computer · doi:10.1007/s00371-021-02166-7 · Cited by 456
Machine learning and integrative analysis of biomedical big data
Mirza, B., Wang, W., Wang, J., Choi, H., Chung, N. C., & Ping, P. (2019) · Genes · doi:10.3390/genes10020087 · Cited by 380
Incorporating stock prices and news sentiments for stock market prediction: A case of Hong Kong
Li, X., Wu, P., & Wang, W. (2020) · Information Processing & Management · doi:10.1016/j.ipm.2020.102212 · Cited by 369
Donini, M., Monteiro, J. M., Pontil, M., Hahn, T., Fallgatter, A. J., Shawe-Taylor, J., & Mourão-Miranda, J. (2019) · NeuroImage · doi:10.1016/j.neuroimage.2019.01.053 · Cited by 19
Self-citation
Metadata
- Authors
- Aiolli, F., & Donini, M.
- Venue
- Neurocomputing
- Publisher
- Elsevier BV
- Published
- 2015-12
- Volume
- 169
- Pages
- 215-224
- ISSN
- 0925-2312 (ISSN-L)
- OpenAlex
- W2060166505
- Cited by
- 179
- References
- 0
- FWCI
- 14.08
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: EasyMKL: a scalable multiple kernel learning algorithm. https://app.cochat.ai/papers/10.1016/j.neucom.2014.11.078
- The paper
- Aiolli, F., & Donini, M. (2015). EasyMKL: a scalable multiple kernel learning algorithm. Neurocomputing. https://doi.org/10.1016/j.neucom.2014.11.078
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.