Demo Data from EDBT 2026 / reviewers in the wild / expert
Rachel Gan Kai Ying
dblp:338/9794
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0001-0661-1692ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 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.
| Software engineering, system software, and programming languages
1 paper |
Empirical software engineering · 100% |
Topics — the 1 heaviest of 1, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Empirical software engineering
process mining |
0.8 | 1 | 2024 | Identifying the Key Attributes in an Unlabeled Event Log for Automated Process Discovery · IEEE Trans. Serv. Comput. 2024 |
Methods — techniques the papers use, named apart from their topics
supervised machine learning · 0.8process model discovery and evaluation · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Identifying the Key Attributes in an Unlabeled Event Log for Automated Process DiscoveryabstractProcess mining discovers and analyzes a process model from historical event logs. The prior art methods use the key attributes of case-id, activity, and timestamp hidden in an event log as clues to discover a process model. However, a user needs to specify them manually, and this can be an exhaustive task. In this article, we propose a two-stage key attribute identification method to avoid such a manual investigation, and thus this is a step toward fully automated process discovery. One of the challenging tasks is how to avoid exhaustive computation due to combinatorial explosion. For this, we narrow down candidates for each key attribute by using supervised machine learning in the first stage and identify the best combination of the key attributes by discovering process models and evaluating them in the second stage. Our computational complexity can be reduced from$\mathcal {O}(N^{3})$to$\mathcal {O}(k^{3})$where$N$and$k$are the numbers of columns and candidates we keep in the first stage, respectively, and usually$k$is much smaller than$N$. We evaluated our method with 14 open datasets and showed that our method could identify the key attributes even with$k = 2$for about 20 seconds for many datasets. Kentaroh Toyoda, Rachel Gan Kai Ying, NengSheng Zhang, Puay Siew Tan |
IEEE Trans. Serv. Comput. | 2 |