Shiying Cheng

dblp:296/5240 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0005-6041-1201ORCID · reported

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

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
2 papers
Trustworthy machine learning · 35% Graph learning · 27% Transfer learning and domain adaptation · 27%

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

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation
few-shot learning
1.012026
Counterfactual Meta-task Augmentation for Few-shot Graph Node Classification · WWW 2026
Machine learning › Graph learning › graph neural network › node classification
few-shot node classification
1.012026
Counterfactual Meta-task Augmentation for Few-shot Graph Node Classification · WWW 2026
Machine learning › Graph learning › graph neural network › node classification
graph node classification
1.012026
Counterfactual Meta-task Augmentation for Few-shot Graph Node Classification · WWW 2026
Machine learning › Transfer learning and domain adaptation
meta-learning
1.012026
Counterfactual Meta-task Augmentation for Few-shot Graph Node Classification · WWW 2026
Machine learning › Trustworthy machine learning › interpretability › local explanation
contrastive explanation
0.912025
Graph Segmentation and Contrastive Enhanced Explainer for Graph Neural Networks · AAAI 2025
Machine learning › Trustworthy machine learning › interpretability › explanation evaluation
explanation faithfulness
0.912025
Graph Segmentation and Contrastive Enhanced Explainer for Graph Neural Networks · AAAI 2025
Computer vision › Segmentation and scene understanding › image segmentation
graph-based segmentation
0.912025
Graph Segmentation and Contrastive Enhanced Explainer for Graph Neural Networks · AAAI 2025
Machine learning › Trustworthy machine learning › interpretability
graph neural network explanation
0.912025
Graph Segmentation and Contrastive Enhanced Explainer for Graph Neural Networks · AAAI 2025

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

meta-learning · 1.0counterfactual augmentation · 1.0edge perturbation · 0.9contrastive learning · 0.9
YearPublicationVenuePosition
2026 Counterfactual Meta-task Augmentation for Few-shot Graph Node Classification
Zhiqiang Wang 0005, Chenchao Zhang, Shiying Cheng, Jianqing Liang, Peng Song 0004
WWW4
2025 Graph Segmentation and Contrastive Enhanced Explainer for Graph Neural Networks
abstract
Graph Neural Networks are powerful tools for modeling graph-structured data but their interpretability remains a significant challenge. Existing model-agnostic GNN explainers aim to identify critical subgraphs or node features relevant to task predictions but often rely on GNN predictions for supervision, lacking ground-truth explanations. This limitation can introduce biases, causing explanations to fail in accurately reflecting the GNN's decision-making processes. To address this, we propose a novel explainer for GNNs with graph segmentation and contrastive learning. Our model introduces a graph segmentation learning module to divide the input graph into explanatory and redundant subgraphs. Next, we implement edge perturbation to augment these subgraphs, generating multiple positive and negative pairs for contrastive learning between explanatory and redundant subgraphs. Finally, we develop a contrastive learning module to guide the learning of explanatory and redundant subgraphs by pulling positive pairs with the same explanatory subgraphs closer while pushing negative pairs with different explanatory subgraphs far away. This approach allows for a clearer distinction of critical subgraphs, enhancing the fidelity of the explanations. We conducted extensive experiments on graph classification and node classification tasks, demonstrating the effectiveness of the proposed method.
Zhiqiang Wang 0005, Jianqing Liang, Jiye Liang, Shiying Cheng, Jiarong Zhang
AAAI5