IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v515y2019icp558-565.html
   My bibliography  Save this article

Cold-start link prediction in multi-relational networks based on network dependence analysis

Author

Listed:
  • Wu, Shun-yao
  • Zhang, Qi
  • Xue, Chuan-yu
  • Liao, Xi-yang

Abstract

Cold-start link prediction has been a hot issue in complex network. Different with most of existing methods, this paper utilizes multiple interactions to predict a specific type of links. In this paper, multiple interactions are abstracted as multi-relational networks, and robust principle component analysis is employed to extract low-dimensional latent factors from sub-networks. Then a distribution free independence test, projection correlation, is introduced to efficiently analyze dependence between target and auxiliary sub-networks. Furthermore, associated auxiliary networks are exploited for cold-start link prediction, which aims to forecast potential links for new/isolated nodes in target sub-networks. Experimental results on 8 bioinformatics datasets validate rationality and effectiveness of the method.

Suggested Citation

  • Wu, Shun-yao & Zhang, Qi & Xue, Chuan-yu & Liao, Xi-yang, 2019. "Cold-start link prediction in multi-relational networks based on network dependence analysis," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 515(C), pages 558-565.
  • Handle: RePEc:eee:phsmap:v:515:y:2019:i:c:p:558-565
    DOI: 10.1016/j.physa.2018.09.082
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437118312147
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

    File URL: https://libkey.io/10.1016/j.physa.2018.09.082?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yuliansyah, Herman & Othman, Zulaiha Ali & Bakar, Azuraliza Abu, 2023. "A new link prediction method to alleviate the cold-start problem based on extending common neighbor and degree centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 616(C).
    2. Tang, Minghu & Wang, Wenjun, 2022. "Cold-start link prediction integrating community information via multi-nonnegative matrix factorization," Chaos, Solitons & Fractals, Elsevier, vol. 162(C).

    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:eee:phsmap:v:515:y:2019:i:c:p:558-565. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.