How Do Large Language Models Understand Graph Patterns? A Benchmark for Graph Pattern Comprehension
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909585310220288 |
|---|---|
| author | Dai, Xinnan Qu, Haohao Shen, Yifen Zhang, Bohang Wen, Qihao Fan, Wenqi Li, Dongsheng Tang, Jiliang Shan, Caihua |
| author_facet | Dai, Xinnan Qu, Haohao Shen, Yifen Zhang, Bohang Wen, Qihao Fan, Wenqi Li, Dongsheng Tang, Jiliang Shan, Caihua |
| contents | Benchmarking the capabilities and limitations of large language models (LLMs) in graph-related tasks is becoming an increasingly popular and crucial area of research. Recent studies have shown that LLMs exhibit a preliminary ability to understand graph structures and node features. However, the potential of LLMs in graph pattern mining remains largely unexplored. This is a key component in fields such as computational chemistry, biology, and social network analysis. To bridge this gap, this work introduces a comprehensive benchmark to assess LLMs' capabilities in graph pattern tasks. We have developed a benchmark that evaluates whether LLMs can understand graph patterns based on either terminological or topological descriptions. Additionally, our benchmark tests the LLMs' capacity to autonomously discover graph patterns from data. The benchmark encompasses both synthetic and real datasets, and a variety of models, with a total of 11 tasks and 7 models. Our experimental framework is designed for easy expansion to accommodate new models and datasets. Our findings reveal that: (1) LLMs have preliminary abilities to understand graph patterns, with O1-mini outperforming in the majority of tasks; (2) Formatting input data to align with the knowledge acquired during pretraining can enhance performance; (3) The strategies employed by LLMs may differ from those used in conventional algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_05298 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | How Do Large Language Models Understand Graph Patterns? A Benchmark for Graph Pattern Comprehension Dai, Xinnan Qu, Haohao Shen, Yifen Zhang, Bohang Wen, Qihao Fan, Wenqi Li, Dongsheng Tang, Jiliang Shan, Caihua Machine Learning Artificial Intelligence Benchmarking the capabilities and limitations of large language models (LLMs) in graph-related tasks is becoming an increasingly popular and crucial area of research. Recent studies have shown that LLMs exhibit a preliminary ability to understand graph structures and node features. However, the potential of LLMs in graph pattern mining remains largely unexplored. This is a key component in fields such as computational chemistry, biology, and social network analysis. To bridge this gap, this work introduces a comprehensive benchmark to assess LLMs' capabilities in graph pattern tasks. We have developed a benchmark that evaluates whether LLMs can understand graph patterns based on either terminological or topological descriptions. Additionally, our benchmark tests the LLMs' capacity to autonomously discover graph patterns from data. The benchmark encompasses both synthetic and real datasets, and a variety of models, with a total of 11 tasks and 7 models. Our experimental framework is designed for easy expansion to accommodate new models and datasets. Our findings reveal that: (1) LLMs have preliminary abilities to understand graph patterns, with O1-mini outperforming in the majority of tasks; (2) Formatting input data to align with the knowledge acquired during pretraining can enhance performance; (3) The strategies employed by LLMs may differ from those used in conventional algorithms. |
| title | How Do Large Language Models Understand Graph Patterns? A Benchmark for Graph Pattern Comprehension |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2410.05298 |