Demo Data from EDBT 2026 / reviewers in the wild / expert
Qingsong Zou
dblp:60/2415
· DBLP profile ↗
15ranked-venue papers
0as first author
14since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 6 · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 5 · 4 since 2021Applied, interdisciplinary, general and emerging computing · 4 · 4 since 2021Computer networks · 3 · 3 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Security and privacy · 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.
| Computer networks
3 papers |
Internet of things and sensor networks · 57% Software-defined and programmable networks · 29% Network performance modeling · 14% | |
| Interdisciplinary, comprehensive, and emerging computing
3 papers |
Computational science and engineering · 100% | |
| Artificial intelligence
3 papers |
Efficient and distributed learning · 65% Graph learning · 25% Generative modeling · 10% | |
| Network and information security
3 papers |
Network security · 40% Security and privacy of machine learning · 32% Cyber-physical and IoT security · 28% | |
| Databases, data mining, and information retrieval
2 papers |
Data mining · 57% Knowledge graphs · 43% | |
| Human-computer interaction and pervasive computing
1 paper |
Ubiquitous computing and smart environments · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Performance modeling and evaluation · 100% |
Topics — the 22 heaviest of 26, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
data-efficient learning |
1.0 | 1 | 2026 | FUSION: Dataset Pruning via Fusing Uncertainty with Structural Information for Optimal Neural Training in Crystal Property Prediction · AAAI 2026 |
Machine learning › Efficient and distributed learning › data selection
data pruning |
1.0 | 1 | 2026 | FUSION: Dataset Pruning via Fusing Uncertainty with Structural Information for Optimal Neural Training in Crystal Property Prediction · AAAI 2026 |
Computational science and engineering › materials informatics
crystal property prediction |
1.0 | 1 | 2026 | FUSION: Dataset Pruning via Fusing Uncertainty with Structural Information for Optimal Neural Training in Crystal Property Prediction · AAAI 2026 |
Computational science and engineering
materials informatics |
1.0 | 1 | 2026 | FUSION: Dataset Pruning via Fusing Uncertainty with Structural Information for Optimal Neural Training in Crystal Property Prediction · AAAI 2026 |
Data mining
anomaly detection |
1.0 | 1 | 2026 | SmartGen: Synthesizing Context-Aware User Behavior Data for Adaptive Smart Home Intelligence · KDD (1) 2026 |
Ubiquitous computing and smart environments
smart home |
1.0 | 1 | 2026 | SmartGen: Synthesizing Context-Aware User Behavior Data for Adaptive Smart Home Intelligence · KDD (1) 2026 |
Computational science and engineering
computational fluid dynamics |
0.9 | 1 | 2025 | CFDONEval: A Comprehensive Evaluation of Operator-Learning Neural Network Models for Computational Fluid Dynamics · IJCAI 2025 |
Computational science and engineering › scientific machine learning
neural operator |
0.9 | 1 | 2025 | CFDONEval: A Comprehensive Evaluation of Operator-Learning Neural Network Models for Computational Fluid Dynamics · IJCAI 2025 |
Security and privacy of machine learning
adversarial attack |
0.9 | 1 | 2025 | ARTEMIS: Adaptive Reweighing for Transferable Evasion via Meta-learning in Zero-Query Network Intrusion Detection Systems · ICNP 2025 |
Network security › intrusion detection and prevention
intrusion detection |
0.9 | 1 | 2025 | ARTEMIS: Adaptive Reweighing for Transferable Evasion via Meta-learning in Zero-Query Network Intrusion Detection Systems · ICNP 2025 |
Computational science and engineering › partial differential equation solver
neural PDE solver |
0.8 | 1 | 2024 | PDENNEval: A Comprehensive Evaluation of Neural Network Methods for Solving PDEs · IJCAI 2024 |
Computational science and engineering
partial differential equations |
0.8 | 1 | 2024 | PDENNEval: A Comprehensive Evaluation of Neural Network Methods for Solving PDEs · IJCAI 2024 |
Software-defined and programmable networks › programmable data plane
in-network machine learning |
0.8 | 1 | 2024 | DeviceRadar: Online IoT Device Fingerprinting in ISPs Using Programmable Switches · IEEE/ACM Trans. Netw. 2024 |
Internet of things and sensor networks › iot security
iot device fingerprinting |
0.8 | 1 | 2024 | DeviceRadar: Online IoT Device Fingerprinting in ISPs Using Programmable Switches · IEEE/ACM Trans. Netw. 2024 |
Software-defined and programmable networks
programmable data plane |
0.8 | 1 | 2024 | DeviceRadar: Online IoT Device Fingerprinting in ISPs Using Programmable Switches · IEEE/ACM Trans. Netw. 2024 |
Internet of things and sensor networks
smart home |
0.8 | 1 | 2024 | Make Your Home Safe: Time-aware Unsupervised User Behavior Anomaly Detection in Smart Homes via Loss-guided Mask · KDD 2024 |
Network performance modeling
synthetic traffic generation |
0.8 | 1 | 2024 | IoTGemini: Modeling IoT Network Behaviors for Synthetic Traffic Generation · IEEE Trans. Mob. Comput. 2024 |
Internet of things and sensor networks › sensor data management › sensor data processing › sensor data analytics
unsupervised anomaly detection |
0.8 | 1 | 2024 | Make Your Home Safe: Time-aware Unsupervised User Behavior Anomaly Detection in Smart Homes via Loss-guided Mask · KDD 2024 |
Performance modeling and evaluation
benchmarking |
0.8 | 1 | 2024 | PDENNEval: A Comprehensive Evaluation of Neural Network Methods for Solving PDEs · IJCAI 2024 |
Machine learning › Graph learning
graph clustering |
0.4 | 1 | 2019 | Variational Graph Embedding and Clustering with Laplacian Eigenmaps · IJCAI 2019 |
Machine learning › Graph learning
network embedding |
0.4 | 1 | 2019 | Variational Graph Embedding and Clustering with Laplacian Eigenmaps · IJCAI 2019 |
Machine learning › Generative modeling
synthetic data generation |
0.3 | 1 | 2026 | SmartGen: Synthesizing Context-Aware User Behavior Data for Adaptive Smart Home Intelligence · KDD (1) 2026 |
Methods — techniques the papers use, named apart from their topics
large language model · 3.0graph neural network · 3.0clustering · 3.0uncertainty quantification · 2.0geometric fingerprinting · 2.0discrete optimization · 2.0traffic classification · 1.5packet size embedding · 1.5model transformation · 1.5graph attention network · 1.5feature separation · 1.5XGBoost · 1.5reinforcement learning · 0.9operator learning · 0.9meta-learning · 0.9finite element method · 0.9ensemble · 0.9time-aware position embedding · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | FUSION: Dataset Pruning via Fusing Uncertainty with Structural Information for Optimal Neural Training in Crystal Property PredictionabstractThe rapid expansion of materials databases offers unprecedented opportunities for accelerating materials discovery via machine learning. However, the widespread assumption that larger datasets inherently produce better models does not hold in practice. We propose FUSION (Fusing Uncertainty with Structural Information for Optimal Neural training), an offline dataset pruning strategy that synergistically combines uncertainty quantification with crystallographic structure analysis via geometric fingerprinting, framing dataset pruning as a discrete optimization problem. Through evaluation across 3 benchmark datasets, FUSION consistently outperforms baselines, including random pruning, uncertainty sampling, weighting factor pruning, diversity sampling, and active learning. It demonstrates robust transferability across 11 diverse architectures, outperforming random pruning by 1.91–13.65% across different datasets, with an average improvement of 6.36%. Moreover, our analysis suggests that different models exhibit varying robustness characteristics when faced with pruned training data, highlighting the importance of model selection tailored to dataset composition. We identify optimal pruning points where removing just 0–8% of training data improves model performance, yielding gains up to 12.67% in specific model–dataset combinations. These results establish a new paradigm for materials informatics that prioritizes data quality over quantity, offering a pathway toward more efficient and sustainable machine learning workflows in computational materials science. Xiean Wang, Pin Chen, Liqin Tan, Yutong Lu, Qingsong Zou |
AAAI | 5 |
| 2026 | SmartGen: Synthesizing Context-Aware User Behavior Data for Adaptive Smart Home IntelligenceabstractAs smart homes become increasingly prevalent, intelligent models are widely used for tasks such as anomaly detection and behavior prediction. These models are typically trained on static datasets, making them brittle to behavioral drift caused by seasonal changes, lifestyle shifts, or evolving routines. However, collecting new behavior data for retraining is often impractical due to its slow pace, high cost, and privacy concerns. In this paper, we propose SmartGen, an LLM-based framework that synthesizes context-aware user behavior data to support continual adaptation of downstream smart home models. SmartGen consists of four key components. First, we design a Time and Semantic-aware Split module to divide long behavior sequences into manageable, semantically coherent subsequences under dual time-span constraints. Second, we propose Semantic-aware Sequence Compression to reduce input length while preserving representative semantics by clustering behavior mapping in latent space. Third, we introduce Graph-guided Sequence Synthesis, which constructs a behavior relationship graph and encodes frequent transitions into prompts, guiding the LLM to generate data aligned with contextual changes while retaining core behavior patterns. Finally, we design a Two-stage Outlier Filter to identify and remove implausible or semantically inconsistent outputs, aiming to improve the factual coherence and behavioral validity of the generated sequences. Experiments on three real-world datasets demonstrate that SmartGen significantly enhances model performance on anomaly detection and behavior prediction tasks under behavioral drift, with anomaly detection improving by 85.43% and behavior prediction by 70.51% on average. The code is available at https://github.com/xzyvoid/SmartGen. Zhiyao Xu, Dan Zhao 0003, Qingsong Zou, Qing Li 0006, Yong Jiang 0001, Yuhang Wang 0036, Jingyu Xiao |
KDD (1) | 3 |
| 2025 | PPFNet: A Parameter-Guided Operator Network for Solving Phase Field Equations
Liao Chen 0003, Qingsong Zou |
ICIC (12) | 2 |
| 2025 | No-Data-Driven Crystal Structure Prediction via Model-Free Reinforcement Learning
Xiean Wang, Pin Chen, Qingsong Zou |
ICIC (19) | 3 |
| 2025 | ARTEMIS: Adaptive Reweighing for Transferable Evasion via Meta-learning in Zero-Query Network Intrusion Detection SystemsabstractMachine Learning-based Network Intrusion Detection Systems (ML-NIDSes) are vital for cyber-security, yet their inherent vulnerability to adversarial attacks poses a persistent challenge. Among these, zero-query transfer-based attacks present a particularly realistic and formidable threat, as adversaries operate with no knowledge of or interaction with the target NIDS. However, the efficacy of such attacks is critically hampered by poor adversarial transferability across diverse NIDS model architectures and by strict protocol-defined constraints on network traffic modifications. To probe the robustness of NIDSes under zero-query attacks, we introduce ARTEMIS, a novel hybrid attack framework engineered to dramatically enhance adversarial transferability for zero-query attacks. ARTEMIS leverages the generalization capabilities of meta-learning to adapt to unknown target models by simulating diverse black-box transfer tasks. Simultaneously, it combines a reinforcement learning-inspired adaptive reweighing mechanism to maximize transfer potential by promoting the effective use of heterogeneous substitute ensembles. Extensive evaluations on the BCCC-CIC-IDS2017/2018 datasets across closed-set, open-set, and cross-set zero-query scenarios confirm that ARTEMIS significantly outperforms state-of-the-art baselines. Our work presents a powerful methodology for NIDS vulnerability assessment and provides crucial insights for developing defenses against transfer-based evasions. Lei Wang 0071, Qingsong Zou, Qing Li 0006, Yong Jiang 0001 |
ICNP | 2 |
| 2025 | CFDONEval: A Comprehensive Evaluation of Operator-Learning Neural Network Models for Computational Fluid DynamicsabstractIn this paper, we introduce CFDONEval, a comprehensive evaluation of 12 operator-learning-based neural network (ON) models to simulate 7 benchmark fluid dynamics problems. These problems cover a range of 2D scenarios, including Darcy flow, two-phase flow, Taylor-Green vortex, lid-driven cavity flow, tube flow, circular cylinder flow, and 3D periodic hill flow. For a rigorous evaluation, we establish 22 fluid dynamics datasets for these benchmark problems, 18 of which are newly generated using traditional numerical methods, such as the finite element method. Our evaluation tackles 5 key challenges: multiscale phenomena, convection dominance, long-term predictions, multiphase flows, and unstructured meshes over complex geometries. We assess computational accuracy, efficiency, and flow field visualization, offering valuable insights into the application of ON models in fluid dynamics research. Our findings show that attention-based models perform well in handling almost all challenges; models with a U-shaped structure excel in handling multiscale problems; and the NU-FNO model demonstrates the smallest relative error in L2 norm when processing nonuniform grid data. The related code, dataset, and appendix are publicly available at: https://github.com/Sysuzqs/CFDNNEval. Menghan Liu, Jianhuan Cen, Ziyang Zhou 0005, Haolong Fan, Guohang Peng, Changye He, Yuzhe Qin, Yutong Lu, Qingsong Zou |
IJCAI | 11 |
| 2024 | PDENNEval: A Comprehensive Evaluation of Neural Network Methods for Solving PDEs
Menghan Liu, Jianhuan Cen, Ziyang Zhou 0005, Qingsong Zou |
IJCAI | 6 |
| 2024 | Make Your Home Safe: Time-aware Unsupervised User Behavior Anomaly Detection in Smart Homes via Loss-guided MaskabstractSmart homes, powered by the Internet of Things, offer great convenience but also pose security concerns due to abnormal behaviors, such as improper operations of users and potential attacks from malicious attackers. Several behavior modeling methods have been proposed to identify abnormal behaviors and mitigate potential risks. However, their performance often falls short because they do not effectively learn less frequent behaviors, consider temporal context, or account for the impact of noise in human behaviors. In this paper, we propose SmartGuard, an autoencoder-based unsupervised user behavior anomaly detection framework. First, we design a Loss-guided Dynamic Mask Strategy (LDMS) to encourage the model to learn less frequent behaviors, which are often overlooked during learning. Second, we propose a Three-level Time-aware Position Embedding (TTPE) to incorporate temporal information into positional embedding to detect temporal context anomaly. Third, we propose a Noise-aware Weighted Reconstruction Loss (NWRL) that assigns different weights for routine behaviors and noise behaviors to mitigate the interference of noise behaviors during inference. Comprehensive experiments on three datasets with ten types of anomaly behaviors demonstrates that SmartGuard consistently outperforms state-of-the-art baselines and also offers highly interpretable results. Jingyu Xiao, Zhiyao Xu, Qingsong Zou, Qing Li 0006, Dan Zhao 0003, Ruoyu Li 0003, Wenxin Tang, Xudong Zuo, Penghui Hu, Yong Jiang 0001, Zixuan Weng, Michael R. Lyu |
KDD | 3 |
| 2024 | DGCL: dual-graph neural networks contrastive learning for molecular property predictionabstractIn this paper, we propose DGCL, a dual-graph neural networks (GNNs)-based contrastive learning (CL) integrated with mixed molecular fingerprints (MFPs) for molecular property prediction. The DGCL-MFP method contains two stages. In the first pretraining stage, we utilize two different GNNs as encoders to construct CL, rather than using the method of generating enhanced graphs as before. Precisely, DGCL aggregates and enhances features of the same molecule by the Graph Isomorphism Network and the Graph Attention Network, with representations extracted from the same molecule serving as positive samples, and others marked as negative ones. In the downstream tasks training stage, features extracted from the two above pretrained graph networks and the meticulously selected MFPs are concated together to predict molecular properties. Our experiments show that DGCL enhances the performance of existing GNNs by achieving or surpassing the state-of-the-art self-supervised learning models on multiple benchmark datasets. Specifically, DGCL increases the average performance of classification tasks by 3.73$\%$ and improves the performance of regression task Lipo by 0.126. Through ablation studies, we validate the impact of network fusion strategies and MFPs on model performance. In addition, DGCL's predictive performance is further enhanced by weighting different molecular features based on the Extended Connectivity Fingerprint. The code and datasets of DGCL will be made publicly available. Xiuyu Jiang, Liqin Tan, Qingsong Zou |
Briefings Bioinform. | 3 |
| 2024 | SeIoT: Detecting Anomalous Semantics in Smart Homes via Knowledge GraphabstractExisting IoT Network Anomaly Detection Systems (NADSes) typically treat IoT devices as independent entities and model them by Euclidean space features. These approaches suffer from low accuracies on new attacks (e.g., platform-based attacks and evasion attacks), since they do not fully consider the semantic information including traffic periodicity and device/environment interactions. In this paper, we propose SeIoT, a knowledge graph-based bimodal anomaly detection framework for smart homes. We propose a knowledge graph structure to represent the semantic information of a smart home. First, we propose the Action Fingerprint module, an efficient and effective traffic classification approach to extract the device actions and features required by the knowledge graph. Then, we propose a bimodal anomaly detection framework including interaction-related and time-related detectors to detect the knowledge graph. We propose a feature separation-based heterogeneous graph attention network that can accurately model the interactions among devices and environments, and a method to represent traffic periodicity for the time-related detector. For evaluation, we set up a real-world testbed and evaluate the detection performance of both device-targeted attacks and platform-based attacks. Experiment results show that SeIoT can achieve better detection capability than prior work on both of the attacks. Ruoyu Li 0003, Qing Li 0006, Qingsong Zou, Dan Zhao 0003, Yong Jiang 0001, Fa Zhu, Athanasios V. Vasilakos |
IEEE Trans. Inf. Forensics Secur. | 4 |
| 2024 | IoTGemini: Modeling IoT Network Behaviors for Synthetic Traffic GenerationabstractSynthetic traffic generation can produce sufficient data for model training of various traffic analysis tasks for IoT networks with few costs and ethical concerns. However, with the increasing functionalities of the latest smart devices, existing approaches can neither customize the traffic generation of various device functions nor generate traffic that preserves the sequentiality among packets as the real traffic. To address these limitations, this paper proposes IoTGemini, a novel framework for high-quality IoT traffic generation, which consists of a Device Modeling Module and a Traffic Generation Module. In the Device Modeling Module, we propose a method to obtain the profiles of the device functions and network behaviors, enabling IoTGemini to customize the traffic generation like using a real IoT device. In the Traffic Generation Module, we design a Packet Sequence Generative Adversarial Network (PS-GAN), which can generate synthetic traffic with high fidelity of both per-packet fields and sequential relationships. We set up a real-world IoT testbed to evaluate IoTGemini. The experiment result shows that IoTGemini can achieve great effectiveness in device modeling, high fidelity of synthetic traffic generation, and remarkable usability to downstream tasks on different traffic datasets and downstream traffic analysis tasks. Ruoyu Li 0003, Qing Li 0006, Qingsong Zou, Dan Zhao 0003, Xiangyi Zeng, Yong Jiang 0001, Feng Lyu 0001, Gaston Ormazabal, Henning Schulzrinne |
IEEE Trans. Mob. Comput. | 3 |
| 2024 | DeviceRadar: Online IoT Device Fingerprinting in ISPs Using Programmable SwitchesabstractDevice fingerprinting can be used by Internet Service Providers (ISPs) to identify vulnerable IoT devices for early prevention of threats. However, due to the wide deployment of middleboxes in ISP networks, some important data, e.g., 5-tuples and flow statistics, are often obscured, rendering many existing approaches invalid. It is further challenged by the high-speed traffic of hundreds of terabytes per day in ISP networks. This paper proposes DeviceRadar, an online IoT device fingerprinting framework that achieves accurate, real-time processing in ISPs using programmable switches. We innovatively exploit “key packets” as a basis of fingerprints only using packet sizes and directions, which appear periodically while exhibiting differences across different IoT devices. To utilize them, we propose a packet size embedding model to discover the spatial relationships between packets. Meanwhile, we design an algorithm to extract the “key packets” of each device, and propose an approach that jointly considers the spatial relationships and the key packets to produce a neighboring key packet distribution, which can serve as a feature vector for machine learning models for inference. Last, we design a model transformation method and a feature extraction process to deploy the model on a programmable data plane within its constrained arithmetic operations and memory to achieve line-speed processing. Our experiments show that DeviceRadar can achieve state-of-the-art accuracy across 77 IoT devices with 40 Gbps throughput, and requires only 1.3% of the processing time compared to GPU-accelerated approaches. Ruoyu Li 0003, Qing Li 0006, Qingsong Zou, Dan Zhao 0003, Gareth Tyson, Guorui Xie, Yong Jiang 0001 |
IEEE/ACM Trans. Netw. | 4 |
| 2023 | Adapter Learning in Pretrained Feature Extractor for Continual Learning of Diseases
Wentao Zhang 0005, Yujun Huang, Tong Zhang 0017, Qingsong Zou, Wei-Shi Zheng 0001 |
MICCAI (2) | 4 |
| 2021 | A Molecular Dynamics Based Multi-scale Platelet Aggregation Model and Its High-Throughput Simulation
Qingsong Zou |
PDCAT | 2 |
| 2019 | Variational Graph Embedding and Clustering with Laplacian EigenmapsabstractAs a fundamental machine learning problem, graph clustering has facilitated various real-world applications, and tremendous efforts had been devoted to it in the past few decades. However, most of the existing methods like spectral clustering suffer from the sparsity, scalability, robustness and handling high dimensional raw information in clustering. To address this issue, we propose a deep probabilistic model, called Variational Graph Embedding and Clustering with Laplacian Eigenmaps (VGECLE), which learns node embeddings and assigns node clusters simultaneously. It represents each node as a Gaussian distribution to disentangle the true embedding position and the uncertainty from the graph. With a Mixture of Gaussian (MoG) prior, VGECLE is capable of learning an interpretable clustering by the variational inference and generative process. In order to learn the pairwise relationships better, we propose a Teacher-Student mechanism encouraging node to learn a better Gaussian from its instant neighbors in the stochastic gradient descent (SGD) training fashion. By optimizing the graph embedding and the graph clustering problem as a whole, our model can fully take the advantages in their correlation. To our best knowledge, we are the first to tackle graph clustering in a deep probabilistic viewpoint. We perform extensive experiments on both synthetic and real-world networks to corroborate the effectiveness and efficiency of the proposed framework. Zitai Chen, Chuan Chen 0001, Zong Zhang, Zibin Zheng, Qingsong Zou |
IJCAI | 5 |