IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i12p2026-d836644.html
   My bibliography  Save this article

Kernel Matrix-Based Heuristic Multiple Kernel Learning

Author

Listed:
  • Stanton R. Price

    (U.S. Army Engineer Research and Development Center, Geotechnical and Structures Laboratory, Vicksburg, MS 39180, USA)

  • Derek T. Anderson

    (Department of Electrical Engineering and Computer Science, University of Missouri, Columbia, MO 65211, USA)

  • Timothy C. Havens

    (Department of Electrical Engineering and Computer Science, College of Computing, Michigan Technological University, Houghton, MI 49931, USA)

  • Steven R. Price

    (U.S. Army Engineer Research and Development Center, Geotechnical and Structures Laboratory, Vicksburg, MS 39180, USA)

Abstract

Kernel theory is a demonstrated tool that has made its way into nearly all areas of machine learning. However, a serious limitation of kernel methods is knowing which kernel is needed in practice. Multiple kernel learning (MKL) is an attempt to learn a new tailored kernel through the aggregation of a set of valid known kernels. There are generally three approaches to MKL: fixed rules, heuristics, and optimization. Optimization is the most popular; however, a shortcoming of most optimization approaches is that they are tightly coupled with the underlying objective function and overfitting occurs. Herein, we take a different approach to MKL. Specifically, we explore different divergence measures on the values in the kernel matrices and in the reproducing kernel Hilbert space (RKHS). Experiments on benchmark datasets and a computer vision feature learning task in explosive hazard detection demonstrate the effectiveness and generalizability of our proposed methods.

Suggested Citation

  • Stanton R. Price & Derek T. Anderson & Timothy C. Havens & Steven R. Price, 2022. "Kernel Matrix-Based Heuristic Multiple Kernel Learning," Mathematics, MDPI, vol. 10(12), pages 1-17, June.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:12:p:2026-:d:836644
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/12/2026/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/12/2026/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:12:p:2026-:d:836644. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.