EDBT 2026 Demo / reviewers in the wild / expert
Zihui Chen
dblp:219/0882
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 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.
| Network and information security
2 papers |
Security and privacy of machine learning · 100% | |
| Artificial intelligence
2 papers |
Graph learning · 76% Trustworthy machine learning · 24% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Security and privacy of machine learning
adversarial attack |
1.9 | 2 | 2026 | Can LLMs Fool Graph Learning? Exploring Universal Adversarial Attacks on Text-Attributed Graphs · WWW 2026 HeTa: Relation-wise Heterogeneous Graph Foundation Attack Model · IJCAI 2025 |
Security and privacy of machine learning › adversarial attack
graph adversarial attack |
1.9 | 2 | 2026 | Can LLMs Fool Graph Learning? Exploring Universal Adversarial Attacks on Text-Attributed Graphs · WWW 2026 HeTa: Relation-wise Heterogeneous Graph Foundation Attack Model · IJCAI 2025 |
Machine learning › Graph learning › graph representation learning
text-attributed graph learning |
1.0 | 1 | 2026 | Can LLMs Fool Graph Learning? Exploring Universal Adversarial Attacks on Text-Attributed Graphs · WWW 2026 |
Machine learning › Graph learning
graph neural network |
0.9 | 1 | 2025 | HeTa: Relation-wise Heterogeneous Graph Foundation Attack Model · IJCAI 2025 |
Machine learning › Graph learning › graph neural network
heterogeneous graph neural network |
0.9 | 1 | 2025 | HeTa: Relation-wise Heterogeneous Graph Foundation Attack Model · IJCAI 2025 |
Machine learning › Trustworthy machine learning
robustness |
0.6 | 2 | 2026 | Can LLMs Fool Graph Learning? Exploring Universal Adversarial Attacks on Text-Attributed Graphs · WWW 2026 HeTa: Relation-wise Heterogeneous Graph Foundation Attack Model · IJCAI 2025 |
Machine learning › Trustworthy machine learning › robustness › adversarial attack
universal adversarial attack |
0.3 | 1 | 2026 | Can LLMs Fool Graph Learning? Exploring Universal Adversarial Attacks on Text-Attributed Graphs · WWW 2026 |
Methods — techniques the papers use, named apart from their topics
pre-trained language model · 2.0large language model · 2.0graph neural network · 2.0relation-aware attack · 1.7foundation surrogate model · 1.7fine-tuning · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Can LLMs Fool Graph Learning? Exploring Universal Adversarial Attacks on Text-Attributed GraphsabstractText-attributed graphs (TAGs) enhance graph learning by integrating rich textual semantics and topological context for each node. While boosting expressiveness, they also expose new vulnerabilities in graph learning through text-based adversarial surfaces. Recent advances leverage diverse backbones, such as graph neural networks (GNNs) and pre-trained language models (PLMs), to capture both structural and textual information in TAGs. This diversity raises a key question: How can we design universal adversarial attacks that generalize across architectures to assess the security of TAG models? The challenge arises from the stark contrast in how different backbones—GNNs and PLMs—perceive and encode graph patterns, coupled with the fact that many PLMs are only accessible via APIs, limiting attacks to black-box settings. To address this, we propose BadGraph, a novel attack framework that deeply elicits large language models' (LLMs) understanding of general graph knowledge to jointly perturb both node topology and textual semantics. Specifically, we design a target influencer retrieval module that leverages graph priors to construct cross-modally aligned attack shortcuts, thereby enabling efficient LLM-based perturbation reasoning. Experiments show that BadGraph achieves universal and effective attacks across GNN- and LLM-based reasoners, with up to a 76.3% performance drop, while theoretical and empirical analyses confirm its stealthy yet interpretable nature. Zihui Chen, Pengfei Jiao, Xiao Wang 0017, Xiang Ao 0001, Dalin Zhang 0001 |
WWW | 1 |
| 2025 | HeTa: Relation-wise Heterogeneous Graph Foundation Attack ModelabstractHeterogeneous Graph Neural Networks (HGNNs) are vulnerable, highlighting the need for tailored attacks to assess their robustness and ensure security. However, existing HGNN attacks often require complex retraining of parameters to generate specific perturbations for new scenarios. Recently, foundation models have opened new horizons for the generalization of graph neural networks by capturing shared semantics across various graph distributions. This leads us to ask: Can we design a foundation attack model for HGNNs that enables generalizable perturbations across different HGNNs, and quickly adapts to new heterogeneous graphs (HGs)? Empirical findings reveal that, despite significant differences in model design and parameter space, different HGNNs surprisingly share common vulnerability patterns from a relation-aware perspective. Therefore, we explore how to design foundation HGNN attack criteria by mining shared attack units. In this paper, we propose a novel relation-wise heterogeneous graph foundation attack model, HeTa. We introduce a foundation surrogate model to align heterogeneity and identify the importance of shared relation-aware attack units. Building on this, we implement a serialized relation-by-relation attack based on the identified relational weights. In this way, the perturbation can be transferred to various target HGNNs and easily fine-tuned for new HGs. Extensive experiments exhibit powerful attack performances and generalizability of our method. Zihui Chen, Pengfei Jiao, Xiao Wang 0017 |
IJCAI | 2 |
| 2025 | TastepepAI: An artificial intelligence platform for taste peptide de novo designabstractTaste peptides have emerged as promising natural flavoring agents attributed to their unique organoleptic properties, high safety profile, and potential health benefits. However, the de novo identification of taste peptides derived from animal, plant, or microbial sources remains a time-consuming and resource-intensive process, significantly impeding their widespread application in the food industry. In this work, we present TastePepAI, a comprehensive artificial intelligence framework for customized taste peptide design and safety assessment. As the key element of this framework, a loss-supervised adaptive variational autoencoder (LA-VAE) is implemented to efficiently optimize the latent representation of sequences during training and facilitate the generation of target peptides with desired taste profiles. Notably, our model incorporates a novel taste-avoidance mechanism, allowing for selective flavor exclusion. Subsequently, our in-house developed toxicity prediction algorithm (SpepToxPred) is integrated in the framework to undergo rigorous safety evaluation of generated peptides. Using this integrated platform, we successfully identified 73 peptides exhibiting sweet, salty, and umami, significantly expanding the current repertoire of taste peptides. This work demonstrates the potential of TastePepAI in accelerating taste peptide discovery for food applications and provides a versatile framework adaptable to broader peptide engineering challenges. Jianda Yue, Jian Ouyang, Hua Tan, Zihui Chen, Changsheng Han, Huanyu Li 0013, Songping Liang, Ying Wang 0069 |
PLoS Comput. Biol. | 6 |