Graph Transformers show immense potential in graph representation learning, yet adaptively capturing complex topological dependencies remains a critical challenge. This paper proposes AdaGPS, a novel adaptive architecture featuring three core improvements. First, the introduced GatEdgeformer module injects edge feature...
Chen-Kai Hao, Ying Yin, He-Xuan Lv et al.· Proceedings of the 35th ACM...· 0 citations
Temporal link prediction aims to forecast future connections from historical interactions. As a fundamental problem in temporal graph learning, existing methods exhibit three major limitations. (1) They usually focus on node-level interaction histories and information aggregated from temporal neighbors, while overlooki...
Yuan Li, Jin-Zhao Han, Kai-Yuan Zhang et al.· ACM International Conference...· 0 citations
Community Search (CS) aims to retrieve query-dependent cohesive subgraphs from networks, playing a crucial role in modern applications such as computing power networks and biological systems. Given the high cost of labeling, unsupervised CS has emerged as a scalable paradigm. However, existing approaches often suffer f...
Xi Yue, Chuan-Hou Sun, Ying Yin et al.· 0 citations