activity
20192025
most citedEnhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsters

600 citations · 785 across the 10 of their papers we have counts for

collaborators

10 papers

cs.LG2025

CLEAR: Cluster-based Prompt Learning on Heterogeneous Graphs

Feiyang Wang, Zhongbao Zhang, Junda Ye +2

Prompt learning has attracted increasing attention in the graph domain as a means to bridge the gap between pretext and downstream tasks. Existing studies on heterogeneous graph pr…

cs.LG2024

Contrastive Sequential Interaction Network Learning on Co-Evolving Riemannian Spaces

Li Sun, Junda Ye, Jiawei Zhang +4

The sequential interaction network usually find itself in a variety of applications, e.g., recommender system. Herein, inferring future interaction is of fundamental importance, an…

cs.LG2024

Motif-aware Riemannian Graph Neural Network with Generative-Contrastive Learning

Li Sun, Zhenhao Huang, Zixi Wang +3

Graphs are typical non-Euclidean data of complex structures. In recent years, Riemannian graph representation learning has emerged as an exciting alternative to Euclidean ones. How…

cs.LG2023

SINCERE: Sequential Interaction Networks representation learning on Co-Evolving RiEmannian manifolds

Junda Ye, Zhongbao Zhang, Li Sun +3

Sequential interaction networks (SIN) have been commonly adopted in many applications such as recommendation systems, search engines and social networks to describe the mutual infl…

cs.LG2023

Contrastive Graph Clustering in Curvature Spaces

Li Sun, Feiyang Wang, Junda Ye +2

Graph clustering is a longstanding research topic, and has achieved remarkable success with the deep learning methods in recent years. Nevertheless, we observe that several importa…

cs.LG2022★ 5 cited

Self-Supervised Continual Graph Learning in Adaptive Riemannian Spaces

Li Sun, Junda Ye, Hao Peng +2

Continual graph learning routinely finds its role in a variety of real-world applications where the graph data with different tasks come sequentially. Despite the success of prior…