EDBT 2026 Demo / reviewers in the wild / expert
Panshi Jin
dblp:193/6495
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1
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.
| Software engineering, system software, and programming languages
1 paper |
Program analysis · 61% Software maintenance and evolution · 30% Empirical software engineering · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program analysis › static analysis
alarm ranking |
0.4 | 1 | 2020 | Automatically and Adaptively Identifying Severe Alerts for Online Service Systems · INFOCOM 2020 |
Software maintenance and evolution › log analysis
anomaly detection |
0.4 | 1 | 2020 | Automatically and Adaptively Identifying Severe Alerts for Online Service Systems · INFOCOM 2020 |
Program analysis › dynamic analysis
runtime monitoring |
0.4 | 1 | 2020 | Automatically and Adaptively Identifying Severe Alerts for Online Service Systems · INFOCOM 2020 |
Empirical software engineering › software engineering research methodology
industrial case study |
0.1 | 1 | 2020 | Automatically and Adaptively Identifying Severe Alerts for Online Service Systems · INFOCOM 2020 |
Methods — techniques the papers use, named apart from their topics
feature engineering · 0.4XGBoost ranking · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Automatically and Adaptively Identifying Severe Alerts for Online Service SystemsabstractIn large-scale online service system, to enhance the quality of services, engineers need to collect various monitoring data and write many rules to trigger alerts. However, the number of alerts is way more than what on-call engineers can properly investigate. Thus, in practice, alerts are classified into several priority levels using manual rules, and on-call engineers primarily focus on handling the alerts with the highest priority level (i.e., severe alerts). Unfortunately, due to the complex and dynamic nature of the online services, this rule-based approach results in missed severe alerts or wasted troubleshooting time on non-severe alerts. In this paper, we propose AlertRank, an automatic and adaptive framework for identifying severe alerts. Specifically, AlertRank extracts a set of powerful and interpretable features (textual and temporal alert features, univariate and multivariate anomaly features for monitoring metrics), adopts XGBoost ranking algorithm to identify the severe alerts out of all incoming alerts, and uses novel methods to obtain labels for both training and testing. Experiments on the datasets from a top global commercial bank demonstrate that AlertRank is effective and achieves the F1-score of 0.89 on average, outperforming all baselines. The feedback from practice shows AlertRank can significantly save the manual efforts for on-call engineers. Nengwen Zhao, Panshi Jin, Xiaoqin Yang, Wenchi Zhang, Kaixin Sui, Dan Pei |
INFOCOM | 2 |