EDBT 2026 Demo / reviewers in the wild / expert
Zhiruo Zhao
dblp:153/5807
· DBLP profile ↗
5ranked-venue papers
3as first author
2since 2021 · last 2025
0000-0002-6952-5337ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorSecurity and privacy · 1Applied, interdisciplinary, general and emerging computing · 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.
| Network and information security
1 paper |
Malware analysis · 77% Web and mobile security · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Malware analysis › android malware
android malware classification |
0.2 | 1 | 2014 | Semantics-Aware Android Malware Classification Using Weighted Contextual API Dependency Graphs · CCS 2014 |
Web and mobile security › mobile security
android security |
0.1 | 1 | 2014 | Semantics-Aware Android Malware Classification Using Weighted Contextual API Dependency Graphs · CCS 2014 |
Methods — techniques the papers use, named apart from their topics
weighted contextual API dependency graph · 0.2graph similarity metrics · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Multi-task reinforcement learning via mixture-of-patterns meta-learning
Zhixiong Xu, Zhiruo Zhao |
Appl. Intell. | 4 |
| 2023 | Improvement of MADRL Equilibrium Based on Pareto OptimizationabstractAbstract In order to solve the incalculability caused by the issue of inconsistent objective functions in multi-agent deep reinforcement learning, the concept of Nash equilibrium is introduced. However, a Marko game may have multiple equilibriums, how to filter out a stable and optimal one is worth studying. Besides solution concept, how to keep the balance between exploration and exploitation is another key issue in reinforcement learning. On basis of the methods, which can converge to Nash equilibrium, this paper makes improvement through Pareto optimization. In order to alleviate the problem of over fitting caused by Pareto optimization and non-convergence caused by strategy change, we use stratified sampling in place of random sampling as assistance. What’s more, our methods are trained through fictitious self-play to make full of self-learning experiences. By analyzing the experiment carried out on MAgent platform, the proposed methods are not only far better than traditional methods, but also reaching or even surpassing the state of art MADRL methods. Zhiruo Zhao, Lei Cao 0007, Jun Lai, Legui Zhang |
Comput. J. | 1 |
| 2018 | Online Anomaly Detection Using Random Forest
Zhiruo Zhao, Kishan G. Mehrotra, Chilukuri K. Mohan |
IEA/AIE | 1 |
| 2015 | Ensemble Algorithms for Unsupervised Anomaly Detection
Zhiruo Zhao, Kishan G. Mehrotra, Chilukuri K. Mohan |
IEA/AIE | 1 |
| 2014 | Semantics-Aware Android Malware Classification Using Weighted Contextual API Dependency GraphsabstractThe drastic increase of Android malware has led to a strong interest in developing methods to automate the malware analysis process. Existing automated Android malware detection and classification methods fall into two general categories: 1) signature-based and 2) machine learning-based. Signature-based approaches can be easily evaded by bytecode-level transformation attacks. Prior learning-based works extract features from application syntax, rather than program semantics, and are also subject to evasion. In this paper, we propose a novel semantic-based approach that classifies Android malware via dependency graphs. To battle transformation attacks, we extract a weighted contextual API dependency graph as program semantics to construct feature sets. To fight against malware variants and zero-day malware, we introduce graph similarity metrics to uncover homogeneous application behaviors while tolerating minor implementation differences. We implement a prototype system, DroidSIFT, in 23 thousand lines of Java code. We evaluate our system using 2200 malware samples and 13500 benign samples. Experiments show that our signature detection can correctly label 93\% of malware instances; our anomaly detector is capable of detecting zero-day malware with a low false negative rate (2\%) and an acceptable false positive rate (5.15\%) for a vetting purpose. Mu Zhang 0001, Yue Duan, Heng Yin 0001, Zhiruo Zhao |
CCS | 4 |