IDEAS home Printed from https://ideas.repec.org/a/hin/jnddns/1279253.html
   My bibliography  Save this article

Multilabel Classification Using Low-Rank Decomposition

Author

Listed:
  • Bo Yang
  • Kunkun Tong
  • Xueqing Zhao
  • Shanmin Pang
  • Jinguang Chen

Abstract

In the multilabel learning framework, each instance is no longer associated with a single semantic, but rather with concept ambiguity. Specifically, the ambiguity of an instance in the input space means that there are multiple corresponding labels in the output space. In most of the existing multilabel classification methods, a binary annotation vector is used to denote the multiple semantic concepts. That is, +1 denotes that the instance has a relevant label, while −1 means the opposite. However, the label representation contains too little semantic information to truly express the differences among multiple different labels. Therefore, we propose a new approach to transform binary label into a real-valued label. We adopt the low-rank decomposition to get latent label information and then incorporate the information and original features to generate new features. Then, using the sparse representation to reconstruct the new instance, the reconstruction error can also be applied in the label space. In this way, we finally achieve the purpose of label conversion. Extensive experiments validate that the proposed method can achieve comparable to or even better results than other state-of-the-art algorithms.

Suggested Citation

  • Bo Yang & Kunkun Tong & Xueqing Zhao & Shanmin Pang & Jinguang Chen, 2020. "Multilabel Classification Using Low-Rank Decomposition," Discrete Dynamics in Nature and Society, Hindawi, vol. 2020, pages 1-8, April.
  • Handle: RePEc:hin:jnddns:1279253
    DOI: 10.1155/2020/1279253
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/DDNS/2020/1279253.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/DDNS/2020/1279253.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/1279253?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnddns:1279253. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.