← Search

Qingtian Zeng

8 accepted papers

2026

Can Pseudo-Label Be More Reliable? A Simple yet Effective Topology-Aware Graph Self-Training Method

AAAI 2026technical

Graph Neural Networks (GNNs) have demonstrated impressive success across a range of graph-based tasks. However, their performance in node classification typically relies on enough high-quality labeled data which are difficult to obtain in practice. Self-training emerges as a promising solution to ta

Cited by 0SourcePDFScholar
2026

DARLING: Dual Hypergraph-Enhanced Curriculum-Guided Graph Structure Learning for Node Classification

AAAI 2026technical

Graph Structure Learning (GSL) aims to simultaneously enhance the original graph and the performance of Graph Neural Networks. However, existing GSL methods for node classification fail to consider neighborhood label dependencies during training, which limits their ability to refine the graph struct

Cited by 0SourcePDFScholar
2026

FreqTAD: Multi-scale Frequency Encoding and Time-Frequency Attention for Anomaly Detection in Dynamic Graphs

AAAI 2026technical

Anomaly detection in dynamic graphs aims to capture the dynamic evolution characteristics of graphs, and then identify abnormal behaviors that deviate from normal patterns. However, previous studies fail to decouple periodic and bursty information during the time encoding process, which hinders thei

Cited by 0SourcePDFScholar
2025

CoLA-Former: Graph Transformer Using Communal Linear Attention for Lightweight Sequential Recommendation

IJCAI 2025

Graph Transformer has shown great promise in capturing the dynamics of user preferences for sequential recommendations. However, the self-attention mechanism within its structure is of quadratic complexity, posing challenges for deployment on devices with limited resources. To this end, we propose a

2025

Dynamic Graph Multi-granularity Attribute Scene Evolution Sequence Recommendation

ICASSP 2025accepted

The recommendation based on dynamic graph sequences aims to reveal complex evolutionary patterns in user-item interactions. Existing methods make predictions by encoding attribute contents through similarity but lack dynamic modeling of fine-grained attribute scenarios, resulting in a deviation in u…

Cited by 0SourceScholar
2025

Generate or Re-Weight? A Mutual-Guidance Method for Class-Imbalanced Graphs

IJCAI 2025

Class imbalance is a widespread problem in graph-structured data. The existing studies tailored for class-imbalanced graphs are typically categorized into generative and re-weighting methods. However, the former merely focuses on quantity balance rather than learning balance. The latter performs the

2025

Heterogeneous Graph Dual-structure Optimization Based Attribute-aware for Recommendation

ICASSP 2025accepted

Heterogeneous Graph Neural Networks(HGNNs) are widely regarded as an effective tool for modeling data with graph structures in recommendation. Current research lacks modeling of user attribute and project attribute distribution preferences, limiting graph structure optimization potential. In respons…

Cited by 0SourceScholar