Demo Data from VLDB 2026 / reviewers in the wild / expert
Hongdou Dong
dblp:402/2026
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 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 |
Graph learning · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning
graph anomaly detection |
1.7 | 2 | 2025 | Dual Encoder Contrastive Learning with Augmented Views for Graph Anomaly Detection · IJCAI 2025 Federated Graph Anomaly Detection Through Contrastive Learning with Global Negative Pairs · AAAI 2025 |
Machine learning › Graph learning
contrastive learning for anomaly detection |
0.9 | 1 | 2025 | Federated Graph Anomaly Detection Through Contrastive Learning with Global Negative Pairs · AAAI 2025 |
Machine learning › Graph learning › graph anomaly detection
federated graph anomaly detection |
0.9 | 1 | 2025 | Federated Graph Anomaly Detection Through Contrastive Learning with Global Negative Pairs · AAAI 2025 |
Machine learning › Graph learning
graph representation learning |
0.9 | 1 | 2025 | Dual Encoder Contrastive Learning with Augmented Views for Graph Anomaly Detection · IJCAI 2025 |
Methods — techniques the papers use, named apart from their topics
reconstruction learning · 0.9pseudo-labeling · 0.9graph transformer · 0.9graph neural network · 0.9graph diffusion · 0.9contrastive self-supervised learning · 0.9contrastive learning · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Federated Graph Anomaly Detection Through Contrastive Learning with Global Negative PairsabstractAnomaly detection on attributed graphs has applications in various domains such as finance and email spam detection, thus gaining substantial attention. Distributed scenarios can also involve issues related to anomaly detection in attribute graphs, such as in medical scenarios. However, most of the existing anomaly detection methods are designed for centralized scenarios, and directly applying them to distributed settings may lead to reduced performance. One possible reason for this issue is that, when graph data are distributed across multiple clients, federated graph learning may struggle to fully exploit the potential of the dispersed data, leading to suboptimal performance. Building on this insight, we propose FedCLGN, a federated graph anomaly detection framework that leverages contrastive self-supervised learning. First, we put forward an augmentation method to maintain global negative pairs on the server. This involves identifying anomalous nodes using pseudo-labels, extracting embedding representations of the negative pairs corresponding to these anomalous nodes from clients, and uploading them to the server. Then, we adopt graph diffusion to enhance the feature representation of nodes, capturing the global structure and local connection patterns. This strategy can strengthen the differentiation between positive and negative instance pairs. Finally, the effectiveness of our approach is verified by experimental results on four real graph datasets. Yazheng Zhao, Hongdou Dong, Keao Xi, Wei Yu 0016, Wenjun Wang 0002 |
AAAI | 3 |
| 2025 | Dual Encoder Contrastive Learning with Augmented Views for Graph Anomaly DetectionabstractGraph anomaly detection (GAD), which aims to identify patterns that deviate significantly from normal nodes in attributed networks, is widely used in financial fraud, cybersecurity, and bioinformatics. The paradigms of jointly optimizing contrastive learning and reconstruction learning have shown significant potential in this field. However, when using GNNs as an encoder, it still faces the problem of over-smoothing, and it is difficult to effectively capture the fine-grain topology information of the graph. In this paper, we introduce an innovative approach: Dual Encoder Contrastive Learning with Augmented Views for Graph Anomaly Detection, named DECLARE. Specifically, the dual encoder integrates the strengths of GNNs and Graph Transformers to learn graph representation from multiple perspectives comprehensively. Although contrastive learning enhances the model's ability to learn discriminative features, it cannot directly identify anomalous patterns. To address this, the reconstruction module independently reconstructs graph structures and attributes, helping the model focus on learning the normal patterns of both structure and attributes. Through extensive experimental analysis, we demonstrate the superiority of DECLARE over the state-of-the-art baselines on six benchmark datasets. Hongdou Dong, Wenjun Wang 0002 |
IJCAI | 2 |