IDEAS home Printed from https://ideas.repec.org/a/spr/scient/v130y2025i2d10.1007_s11192-024-05219-5.html
   My bibliography  Save this article

Publication recommendation in incomplete networks based on graph learning

Author

Listed:
  • Jiaying Liu

    (Dalian University of Technology)

  • Jun Zhang

    (Dalian University of Technology)

Abstract

Tremendous academic information in scholarly big data brings problems of information overload and information loss. Scientific paper recommendation systems are developed to help with the problem of information overload by recommending relevant papers to researchers. However, few recommender systems focus on the problem of missing information. To tackle this problem, we develop a scientific paper recommendation system, namely INSURE, to recommend papers in an incomplete network. INSURE can mine the implicit relationships between nodes, and infer the original network structure and attributes from the observed incomplete network. Hence, the problem of confusion results caused by missing structure and attributes can be solved. At the same time, INSURE takes into account both structural similarity and textual similarity of the paper nodes in the recommendation process. In addition, INSURE also considers factors affecting paper quality during random walks to recommend high-quality studies when citations have not accumulated. Experimental results on the CORD-19 dataset show that INSURE outperforms baselines in terms of recommendation performance and recommendation quality.

Suggested Citation

  • Jiaying Liu & Jun Zhang, 2025. "Publication recommendation in incomplete networks based on graph learning," Scientometrics, Springer;Akadémiai Kiadó, vol. 130(2), pages 565-591, February.
    • Handle: RePEc:spr:scient:v:130:y:2025:i:2:d:10.1007_s11192-024-05219-5
    DOI: 10.1007/s11192-024-05219-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11192-024-05219-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11192-024-05219-5?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.

    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:spr:scient:v:130:y:2025:i:2:d:10.1007_s11192-024-05219-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.