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

Geometric Metric Learning for Multi-Output Learning

Author

Listed:
  • Huiping Gao

    (The School of Computer Science & Communications Engineering, Jiangsu University, Zhenjiang 212013, China)

  • Zhongchen Ma

    (The School of Computer Science & Communications Engineering, Jiangsu University, Zhenjiang 212013, China)

Abstract

Due to its wide applications, multi-output learning that predicts multiple output values for a single input at the same time is becoming more and more attractive. As one of the most popular frameworks for dealing with multi-output learning, the performance of the k-nearest neighbor (kNN) algorithm mainly depends on the metric used to compute the distance between different instances. In this paper, we propose a novel cost-weighted geometric mean metric learning method for multi-output learning. Specifically, this method learns a geometric mean metric which can make the distance between the input embedding and its correct output be smaller than the distance between the input embedding and the outputs of its nearest neighbors. The learned geometric mean metric can discover output dependencies and move the instances with different outputs far away in the embedding space. In addition, our objective function has a closed solution, and thus the calculation speed is very fast. Compared with state-of-the-art methods, it is easier to explain and also has a faster calculation speed. Experiments conducted on two multi-output learning tasks (i.e., multi-label classification and multi-objective regression) have confirmed that our method provides better results than state-of-the-art methods.

Suggested Citation

  • Huiping Gao & Zhongchen Ma, 2022. "Geometric Metric Learning for Multi-Output Learning," Mathematics, MDPI, vol. 10(10), pages 1-12, May.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:10:p:1632-:d:813003
    as

    Download full text from publisher

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

    File URL: https://www.mdpi.com/2227-7390/10/10/1632/
    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:10:p:1632-:d:813003. 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.