150 citations · 382 across the 30 of their papers we have counts for
15 papers · 1 filter
Beyond Parameter Finetuning: Test-Time Representation Refinement for Node Classification
Jiaxin Zhang, Yiqi Wang, Siwei Wang +4
Graph Neural Networks frequently exhibit significant performance degradation in the out-of-distribution test scenario. While test-time training (TTT) offers a promising solution, e…
Test-Time Training on Graphs with Large Language Models (LLMs)
Jiaxin Zhang, Yiqi Wang, Xihong Yang +6
Graph Neural Networks have demonstrated great success in various fields of multimedia. However, the distribution shift between the training and test data challenges the effectivene…
Efficient Multi-View Graph Clustering with Local and Global Structure Preservation
Yi Wen, Suyuan Liu, Xinhang Wan +5
Anchor-based multi-view graph clustering (AMVGC) has received abundant attention owing to its high efficiency and the capability to capture complementary structural information acr…
Reinforcement Graph Clustering with Unknown Cluster Number
Yue Liu, Ke Liang, Jun Xia +5
Deep graph clustering, which aims to group nodes into disjoint clusters by neural networks in an unsupervised manner, has attracted great attention in recent years. Although the pe…
CONVERT:Contrastive Graph Clustering with Reliable Augmentation
Xihong Yang, Cheng Tan, Yue Liu +7
Contrastive graph node clustering via learnable data augmentation is a hot research spot in the field of unsupervised graph learning. The existing methods learn the sampling distri…
Dink-Net: Neural Clustering on Large Graphs
Yue Liu, Ke Liang, Jun Xia +4
Deep graph clustering, which aims to group the nodes of a graph into disjoint clusters with deep neural networks, has achieved promising progress in recent years. However, the exis…
SARF: Aliasing Relation Assisted Self-Supervised Learning for Few-shot Relation Reasoning
Lingyuan Meng, Ke Liang, Bin Xiao +5
Few-shot relation reasoning on knowledge graphs (FS-KGR) aims to infer long-tail data-poor relations, which has drawn increasing attention these years due to its practicalities. Th…
Self-Supervised Temporal Graph learning with Temporal and Structural Intensity Alignment
Meng Liu, Ke Liang, Yawei Zhao +5
Temporal graph learning aims to generate high-quality representations for graph-based tasks with dynamic information, which has recently garnered increasing attention. In contrast…
Hard Sample Aware Network for Contrastive Deep Graph Clustering
Yue Liu, Xihong Yang, Sihang Zhou +7
Contrastive deep graph clustering, which aims to divide nodes into disjoint groups via contrastive mechanisms, is a challenging research spot. Among the recent works, hard sample m…
Cluster-guided Contrastive Graph Clustering Network
Xihong Yang, Yue Liu, Sihang Zhou +6
Benefiting from the intrinsic supervision information exploitation capability, contrastive learning has achieved promising performance in the field of deep graph clustering recentl…
GraphLearner: Graph Node Clustering with Fully Learnable Augmentation
Xihong Yang, Erxue Min, Ke Liang +6
Contrastive deep graph clustering (CDGC) leverages the power of contrastive learning to group nodes into different clusters. The quality of contrastive samples is crucial for achie…
A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource
Yue Liu, Jun Xia, Sihang Zhou +7
Graph clustering, which aims to divide nodes in the graph into several distinct clusters, is a fundamental yet challenging task. Benefiting from the powerful representation capabil…
Simple Contrastive Graph Clustering
Yue Liu, Xihong Yang, Sihang Zhou +1
Contrastive learning has recently attracted plenty of attention in deep graph clustering for its promising performance. However, complicated data augmentations and time-consuming g…
Mixed Graph Contrastive Network for Semi-Supervised Node Classification
Xihong Yang, Yiqi Wang, Yue Liu +5
Graph Neural Networks (GNNs) have achieved promising performance in semi-supervised node classification in recent years. However, the problem of insufficient supervision, together…
Deep Graph Clustering via Dual Correlation Reduction
Yue Liu, Wenxuan Tu, Sihang Zhou +4
Deep graph clustering, which aims to reveal the underlying graph structure and divide the nodes into different groups, has attracted intensive attention in recent years. However, w…