IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i7p1147-d1624824.html
   My bibliography  Save this article

Large Language Models Meet Graph Neural Networks: A Perspective of Graph Mining

Author

Listed:
  • Yuxin You

    (School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China)

  • Zhen Liu

    (School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China)

  • Xiangchao Wen

    (School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China)

  • Yongtao Zhang

    (School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China)

  • Wei Ai

    (54th Research Institute of CETC, Shijiazhuang 050081, China)

Abstract

Graph mining is an important area in data mining and machine learning that involves extracting valuable information from graph-structured data. In recent years, significant progress has been made in this field through the development of graph neural networks (GNNs). However, GNNs are still deficient in generalizing to diverse graph data. Aiming to this issue, large language models (LLMs) could provide new solutions for graph mining tasks with their superior semantic understanding. In this review, we systematically review the combination and application techniques of LLMs and GNNs and present a novel taxonomy for research in this interdisciplinary field, which involves three main categories: GNN-driving-LLM(GdL), LLM-driving-GNN(LdG), and GNN-LLM-co-driving(GLcd). Within this framework, we reveal the capabilities of LLMs in enhancing graph feature extraction as well as improving the effectiveness of downstream tasks such as node classification, link prediction, and community detection. Although LLMs have demonstrated their great potential in handling graph-structured data, their high computational requirements and complexity remain challenges. Future research needs to continue to explore how to efficiently fuse LLMs and GNNs to achieve more powerful graph learning and reasoning capabilities and provide new impetus for the development of graph mining techniques.

Suggested Citation

  • Yuxin You & Zhen Liu & Xiangchao Wen & Yongtao Zhang & Wei Ai, 2025. "Large Language Models Meet Graph Neural Networks: A Perspective of Graph Mining," Mathematics, MDPI, vol. 13(7), pages 1-34, March.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:7:p:1147-:d:1624824
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/7/1147/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/7/1147/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:13:y:2025:i:7:p:1147-:d:1624824. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.