most citedLess Can Be More: Unsupervised Graph Pruning for Large-scale Dynamic Graphs

3 citations · 6 across the 6 of their papers we have counts for

collaborators

6 papers

cs.LG20243 cited

Revisiting Modularity Maximization for Graph Clustering: A Contrastive Learning Perspective

Yunfei Liu, Jintang Li, Yuehe Chen +9

Graph clustering, a fundamental and challenging task in graph mining, aims to classify nodes in a graph into several disjoint clusters. In recent years, graph contrastive learning…

cs.NE2024

SGHormer: An Energy-Saving Graph Transformer Driven by Spikes

Huizhe Zhang, Jintang Li, Liang Chen +1

Graph Transformers (GTs) with powerful representation learning ability make a huge success in wide range of graph tasks. However, the costs behind outstanding performances of GTs a…

cs.LG2023

HeteroNet: Heterophily-aware Representation Learning on Heterogenerous Graphs

Jintang Li, Zheng Wei, Jiawang Dan +9

Real-world graphs are typically complex, exhibiting heterogeneity in the global structure, as well as strong heterophily within local neighborhoods. While a growing body of literat…

cs.LG2023

SAILOR: Structural Augmentation Based Tail Node Representation Learning

Jie Liao, Jintang Li, Liang Chen +3

Graph Neural Networks (GNNs) have achieved state-of-the-art performance in representation learning for graphs recently. However, the effectiveness of GNNs, which capitalize on the…

cs.LG2023

SAD: Semi-Supervised Anomaly Detection on Dynamic Graphs

Sheng Tian, Jihai Dong, Jintang Li +7

Anomaly detection aims to distinguish abnormal instances that deviate significantly from the majority of benign ones. As instances that appear in the real world are naturally conne…

cs.LG20233 cited

Less Can Be More: Unsupervised Graph Pruning for Large-scale Dynamic Graphs

Jintang Li, Sheng Tian, Ruofan Wu +6

The prevalence of large-scale graphs poses great challenges in time and storage for training and deploying graph neural networks (GNNs). Several recent works have explored solution…