EDBT 2026 Demo / reviewers in the wild / expert
Weixuan Shen
dblp:305/1884
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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 · 54% Trustworthy machine learning · 46% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning › robustness
adversarial robustness |
0.9 | 1 | 2025 | Adversarial Contrastive Graph Masked AutoEncoder Against Graph Structure and Feature Dual Attacks · AAAI 2025 |
Machine learning › Graph learning
graph neural network |
0.9 | 1 | 2025 | Adversarial Contrastive Graph Masked AutoEncoder Against Graph Structure and Feature Dual Attacks · AAAI 2025 |
Machine learning › Trustworthy machine learning › adversarial machine learning
graph neural network robustness |
0.9 | 1 | 2025 | Adversarial Contrastive Graph Masked AutoEncoder Against Graph Structure and Feature Dual Attacks · AAAI 2025 |
Machine learning › Graph learning › graph representation learning
robust graph representation learning |
0.9 | 1 | 2025 | Adversarial Contrastive Graph Masked AutoEncoder Against Graph Structure and Feature Dual Attacks · AAAI 2025 |
Machine learning › Graph learning › graph self-supervised learning
graph masked autoencoder |
0.3 | 1 | 2025 | Adversarial Contrastive Graph Masked AutoEncoder Against Graph Structure and Feature Dual Attacks · AAAI 2025 |
Methods — techniques the papers use, named apart from their topics
masked autoencoder · 0.9contrastive learning · 0.9adversarial feature masking · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Adversarial Contrastive Graph Masked AutoEncoder Against Graph Structure and Feature Dual AttacksabstractGraph Neural Networks (GNNs) have been shown vulnerable to graph adversarial attacks. Current robust graph representation learning methods mainly defend against graph structure attack, and improves performance of GNNs. However node feature in graph can been easily attacked in reality. The joint defense on graph structure and feature dual attacks remains challenging yet less studied. To fulfill this gap, we propose Adversarial Contrastive Graph Masked AutoEncoder (ACGMAE) to defend against graph structure and feature dual attacks. ACGMAE employs adversarial feature masking for reconstructing node feature to mitigate the influence of feature attack. ACGMAE employs contrastive learning on kNN graph and attacked graph, considers neighbor nodes as positive samples, and further calculates their probabilities being true positive to mitigate the effect of adversarial edges. Extensive experiments on node classification and clustering demonstrate the effectiveness of the proposed ACGMAE especially under graph structure and feature dual attacks. Weixuan Shen, Xiaobo Shen 0001, Shirui Pan |
AAAI | 1 |