IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0290018.html

Link prediction and feature relevance in knowledge networks: A machine learning approach

Author

Listed:
  • Antonio Zinilli
  • Giovanni Cerulli

Abstract

We propose a supervised machine learning approach to predict partnership formation between universities. We focus on successful joint R&D projects funded by the Horizon 2020 programme in three research domains: Social Sciences and Humanities, Physical and Engineering Sciences, and Life Sciences. We perform two related analyses: link formation prediction, and feature importance detection. In predicting link formation, we consider two settings: one including all features, both exogenous (pertaining to the node) and endogenous (pertaining to the network); and one including only exogenous features (thus removing the network attributes of the nodes). Using out-of-sample cross-validated accuracy, we obtain 91% prediction accuracy when both types of attributes are used, and around 67% when using only the exogenous ones. This proves that partnership predictive power is on average 24% larger for universities already incumbent in the programme than for newcomers (for which network attributes are clearly unknown). As for feature importance, by computing super-learner average partial effects and elasticities, we find that the endogenous attributes are the most relevant in affecting the probability to generate a link, and observe a largely negative elasticity of the link probability to feature changes, fairly uniform across attributes and domains.

Suggested Citation

  • Antonio Zinilli & Giovanni Cerulli, 2023. "Link prediction and feature relevance in knowledge networks: A machine learning approach," PLOS ONE, Public Library of Science, vol. 18(11), pages 1-32, November.
  • Handle: RePEc:plo:pone00:0290018
    DOI: 10.1371/journal.pone.0290018
    as

    Download full text from publisher

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

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

    File URL: https://libkey.io/10.1371/journal.pone.0290018?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
    ---><---

    References listed on IDEAS

    as
    1. Jiachen Sun & Ling Feng & Jiarong Xie & Xiao Ma & Dashun Wang & Yanqing Hu, 2020. "Revealing the predictability of intrinsic structure in complex networks," Nature Communications, Nature, vol. 11(1), pages 1-10, December.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Liping Zhang & Jinyi Chen & Hanhui Qiu & Hailin Li & Yenchun Jim Wu, 2026. "The interactive effects of knowledge elements and collaboration networks on exploratory innovation performance: evidence from the Chinese artificial intelligence industry," Humanities and Social Sciences Communications, Palgrave Macmillan, vol. 13(1), pages 1-18, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jing, Fei & Zhang, Zhong & Wu, Jian-Liang & Hu, Die & Zhang, Zi-Ke, 2025. "Quantifying and predicting evolutionary networks," Chaos, Solitons & Fractals, Elsevier, vol. 191(C).
    2. Sun, Jiachen & Feng, Ling & Du, Mingwei & Ma, Xiao & Fan, Zhengping & Gloor, Peter & Hu, Yanqing, 2021. "Ultra-efficient information detection on large-scale online social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 581(C).
    3. Huang, Shuhong & Wang, Xiangrong & Peng, Liyang & Xie, Jiarong & Sun, Jiachen & Hu, Yanqing, 2021. "Optimal compression for bipartite networks," Chaos, Solitons & Fractals, Elsevier, vol. 151(C).

    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:0290018. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.