IDEAS home Printed from https://ideas.repec.org/a/eee/infome/v18y2024i4s1751157724001056.html
   My bibliography  Save this article

A multi-entity reinforced main path analysis: Heterogeneous network embedding considering knowledge proximity

Author

Listed:
  • Yan, Zhaoping
  • Fan, Kaiyu

Abstract

Main path analysis (MPA) is an important approach in detecting the trajectory of knowledge diffusion in a specific research domain. Previous studies always focus on citation-based relationships, overlooking other structural forms in citation network. This study introduces a multi-entity reinforced MPA model by constructing a knowledge graph from paper metadata, including citations, authors, journals, and keywords. We construct heterogeneous network to reveal relationships among various entities. Different knowledge graph embedding models are employed to train the network, thereby obtaining entity and relation embeddings. The cosine similarity algorithm is adopted to measure the knowledge proximity between these embeddings. We take the Internet of Thing domain as an example to verify the performance of the multi-entity reinforced MPA through both quantitative and qualitative analysis. Our findings indicate that the adjusted MPA exhibits stronger topic relevance, demonstrating the effectiveness of the method in capturing complex knowledge relationships.

Suggested Citation

  • Yan, Zhaoping & Fan, Kaiyu, 2024. "A multi-entity reinforced main path analysis: Heterogeneous network embedding considering knowledge proximity," Journal of Informetrics, Elsevier, vol. 18(4).
  • Handle: RePEc:eee:infome:v:18:y:2024:i:4:s1751157724001056
    DOI: 10.1016/j.joi.2024.101593
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1751157724001056
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.joi.2024.101593?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:eee:infome:v:18:y:2024:i:4:s1751157724001056. 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.elsevier.com/locate/joi .

    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.