Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Calvin Hong Yi Li

dblp:257/5547 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none

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

Computer networks · 1Databases, data management, data science and information retrieval · 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
Trustworthy machine learning · 78% Graph learning · 22%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › adversarial machine learning
adversarial defense
0.812024
Fight Fire with Fire: Towards Robust Graph Neural Networks on Dynamic Graphs via Actively Defense · Proc. VLDB Endow. 2024
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.812024
Fight Fire with Fire: Towards Robust Graph Neural Networks on Dynamic Graphs via Actively Defense · Proc. VLDB Endow. 2024
Machine learning › Graph learning
dynamic graph learning
0.812024
Fight Fire with Fire: Towards Robust Graph Neural Networks on Dynamic Graphs via Actively Defense · Proc. VLDB Endow. 2024
Machine learning › Trustworthy machine learning › adversarial machine learning › graph neural network robustness
graph adversarial defense
0.812024
Fight Fire with Fire: Towards Robust Graph Neural Networks on Dynamic Graphs via Actively Defense · Proc. VLDB Endow. 2024
Machine learning › Trustworthy machine learning › robustness
adversarial attack
0.212024
Fight Fire with Fire: Towards Robust Graph Neural Networks on Dynamic Graphs via Actively Defense · Proc. VLDB Endow. 2024
Machine learning › Trustworthy machine learning › graph adversarial attack
node injection attack
0.212024
Fight Fire with Fire: Towards Robust Graph Neural Networks on Dynamic Graphs via Actively Defense · Proc. VLDB Endow. 2024

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

guardian node injection · 0.8gradient-based optimization · 0.8
YearPublicationVenuePosition
2024 Fight Fire with Fire: Towards Robust Graph Neural Networks on Dynamic Graphs via Actively Defense
abstract
Graph neural networks (GNNs) have achieved great success on various graph tasks. However, recent studies have revealed that GNNs are vulnerable to injective attacks. Due to the openness of platforms, attackers can inject malicious nodes with carefully designed edges and node features, making GNNs misclassify the labels of target nodes. To resist such adversarial attacks, recent researchers propose GNN defenders. They assume that the attack patterns have been known, e.g., attackers tend to add edges between dissimilar nodes. Then, they remove edges between dissimilar nodes from attacked graphs, aiming to alleviate the negative impact of adversarial attacks. Nevertheless, on dynamic graphs, attackers can change their attack strategies at different times, making existing passive GNN defenders that are passively designed for specific attack patterns fail to resist attacks. In this paper, we propose a novel active GNN defender for dynamic graphs, namely ADGNN, which actively injects guardian nodes to protect target nodes from effective attacks. Specifically, we first formulate an active defense objective to design guardian node behaviors. This objective targets to disrupt the prediction of attackers and protect easily attacked nodes, thereby preventing attackers from generating effective attacks. Then, we propose a gradient-based algorithm with two acceleration techniques to optimize this objective. Extensive experiments on four real-world graph datasets demonstrate the effectiveness of our proposed defender and its capacity to enhance existing GNN defenders.
Haoyang Li 0002, Shimin Di, Calvin Hong Yi Li, Lei Chen 0002, Xiaofang Zhou 0001
Proc. VLDB Endow.3
2020 Circa: collaborative code offloading among multiple mobile devices
Xueling Lin, Jingjie Jiang, Calvin Hong Yi Li, Bo Li 0001, Baochun Li
Wirel. Networks3