ComGPT: Detecting Local Community Structure with Large Language Models
Li Ni, Haowen Shen, Lin Mu, Yiwen Zhang, Wenjian Luo

TL;DR
This paper introduces ComGPT, a novel GPT-guided seed expansion algorithm for local community detection in graphs, leveraging a new graph encoding method and prompts to improve LLM understanding and outperform baselines.
Contribution
The paper proposes ComGPT, a new LLM-based community detection method with a graph encoding technique and prompts, addressing seed dependence and community diffusion issues.
Findings
ComGPT outperforms baseline algorithms in community detection tasks.
The ComIncident encoding improves LLM understanding of community structures.
The NSG prompt enhances LLM decision-making in node selection.
Abstract
Large Language Models (LLMs), like GPT-3.5-turbo, have demonstrated the ability to understand graph structures and have achieved excellent performance in various graph reasoning tasks, such as node classification. Despite their strong abilities in graph reasoning tasks, they lack specific domain knowledge and have a weaker understanding of community-related graph information, which hinders their capabilities in the community detection task. Moreover, local community detection algorithms based on seed expansion, referred to as seed expansion algorithms, often face several shortcomings, including the seed-dependent problem, community diffusion, and free rider effect. To use LLMs to overcome the above shortcomings, we explore a GPT-guided seed expansion algorithm named ComGPT. ComGPT iteratively selects potential nodes by local modularity from the detected community's neighbors, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
