IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0289568.html
   My bibliography  Save this article

Link prediction on bipartite networks using matrix factorization with negative sample selection

Author

Listed:
  • Siqi Peng
  • Akihiro Yamamoto
  • Kimihito Ito

Abstract

We propose a new method for bipartite link prediction using matrix factorization with negative sample selection. Bipartite link prediction is a problem that aims to predict the missing links or relations in a bipartite network. One of the most popular solutions to the problem is via matrix factorization (MF), which performs well but requires reliable information on both absent and present network links as training samples. This, however, is sometimes unavailable since there is no ground truth for absent links. To solve the problem, we propose a technique called negative sample selection, which selects reliable negative training samples using formal concept analysis (FCA) of a given bipartite network in advance of the preceding MF process. We conduct experiments on two hypothetical application scenarios to prove that our joint method outperforms the raw MF-based link prediction method as well as all other previously-proposed unsupervised link prediction methods.

Suggested Citation

  • Siqi Peng & Akihiro Yamamoto & Kimihito Ito, 2023. "Link prediction on bipartite networks using matrix factorization with negative sample selection," PLOS ONE, Public Library of Science, vol. 18(8), pages 1-19, August.
  • Handle: RePEc:plo:pone00:0289568
    DOI: 10.1371/journal.pone.0289568
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0289568
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0289568&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0289568?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:plo:pone00:0289568. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.