Qianhua Tang

dblp:430/3695 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Graph learning · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph neural network
1.012026
Structure-Enhanced Adapter for Self-Supervised Heterogeneous Graph Learning · AAAI 2026
Machine learning › Graph learning
graph self-supervised learning
1.012026
Structure-Enhanced Adapter for Self-Supervised Heterogeneous Graph Learning · AAAI 2026
Machine learning › Graph learning
graph structure learning
1.012026
Structure-Enhanced Adapter for Self-Supervised Heterogeneous Graph Learning · AAAI 2026
Machine learning › Graph learning
heterogeneous graph learning
1.012026
Structure-Enhanced Adapter for Self-Supervised Heterogeneous Graph Learning · AAAI 2026
Machine learning › Graph learning › graph neural network
heterogeneous graph neural network
1.012026
Structure-Enhanced Adapter for Self-Supervised Heterogeneous Graph Learning · AAAI 2026

Methods — techniques the papers use, named apart from their topics

self-supervised learning · 1.0graph neural network · 1.0adapter · 1.0
YearPublicationVenuePosition
2026 Structure-Enhanced Adapter for Self-Supervised Heterogeneous Graph Learning
abstract
Real-world heterogeneous data is commonly modeled as heterogeneous information networks (HINs). Building upon advancements in graph neural networks (GNNs), existing research has significantly progressed in semi-supervised and self-supervised paradigms for heterogeneous GNNs (HGNNs). However, these methods overlook inherent structural deficiencies in raw heterogeneous graphs. We identifies unique structural noise in HINs: missing potential critical edges and multi-relational semantically redundant edges, which force existing HGNNs to learn suboptimal representations on fixed topologies. Crucially, prior limited studies address only partial noise while remaining architecturally entrenched and tightly coupled with specific models. To break this bottleneck, we propose a plug-and-play Heterogeneous graph Structure ADaPter (HSADP) that simultaneously resolves task/model decoupling challenges while accounting for HIN-specific structural properties with with two core components: a dynamic homogeneous subgraph enhancer recovering latent topology across semantic views and a learnable heterogeneous edge discriminator dynamically suppressing redundant edges while collaboratively optimizing semantic graphs. Extensive experiments across multi-domain datasets demonstrate our method’s effectiveness and compatibility. The adapter significantly boosts node classification accuracy for multiple SOTA approaches and surpasses specially designed heterogeneous graph structure learning models.
Fengyu Yan, Di Jin 0001, Xiaobao Wang, Qianhua Tang, Dongxiao He
AAAI4