9 papers
Dynamic Graph Prompting via Topology-Routed Mixed-Curvature Experts
Quanxin Wang, Xuanting Xie, Bingheng Li +4
Dynamic graph prompting freezes a pre-trained temporal backbone and adapts it to label-scarce downstream tasks using lightweight prompts. However, existing methods operate within a…
Provable Filter for Real-world Graph Clustering
Xuanting Xie, Erlin Pan, Zhao Kang +2
Graph clustering, an important unsupervised problem, has been shown to be more resistant to advances in Graph Neural Networks (GNNs). In addition, almost all clustering methods foc…
Clustering as Reasoning: A -Means Interpretation of Chain-of-Thought Graph Learning
Xuanting Xie, Zhaochen Guo, Bingheng Li +4
Chain-of-Thought (CoT) prompting has shown promise in enhancing the reasoning capabilities of large language models (LLMs) on text-attributed graphs (TAGs). This work reframes CoT-…
Attention Beyond Neighborhoods: Reviving Transformer for Graph Clustering
Xuanting Xie, Bingheng Li, Erlin Pan +3
Attention mechanisms have become a cornerstone in modern neural networks, driving breakthroughs across diverse domains. However, their application to graph structured data, where c…
Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing
Xuanting Xie, Bingheng Li, Erlin Pan +2
Graph Neural Networks (GNNs) have become a dominant approach to learning graph representations, primarily because of their message-passing mechanisms. However, GNNs typically adopt…
Homophily Enhanced Graph Domain Adaptation
Ruiyi Fang, Bingheng Li, Jingyu Zhao +5
Graph Domain Adaptation (GDA) transfers knowledge from labeled source graphs to unlabeled target graphs, addressing the challenge of label scarcity. In this paper, we highlight the…