Demo Data from SIGIR 2026 / reviewers in the wild / expert
Qinlong Guo
dblp:53/11498
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 3 · 1 first-author
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.2 | 1 | 2013 | Efficient Selection of Process Mining Algorithms · IEEE Trans. Serv. Comput. 2013 |
Methods — techniques the papers use, named apart from their topics
regression model · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Mining Invisible Tasks in Non-free-choice Constructs
Qinlong Guo, Lijie Wen 0001, Jianmin Wang 0001, Philip S. Yu |
BPM | 1 |
| 2013 | Efficient Selection of Process Mining AlgorithmsabstractWhile many process mining algorithms have been proposed recently, there does not exist a widely accepted benchmark to evaluate and compare these process mining algorithms. As a result, it can be difficult to choose a suitable process mining algorithm for a given enterprise or application domain. Some recent benchmark systems have been developed and proposed to address this issue. However, evaluating available process mining algorithms against a large set of business models (e.g., in a large enterprise) can be computationally expensive, tedious, and time-consuming. This paper investigates a scalable solution that can evaluate, compare, and rank these process mining algorithms efficiently, and hence proposes a novel framework that can efficiently select the process mining algorithms that are most suitable for a given model set. In particular, using our framework, only a portion of process models need empirical evaluation and others can be recommended directly via a regression model. As a further optimization, this paper also proposes a metric and technique to select high-quality reference models to derive an effective regression model. Experiments using artificial and real data sets show that our approach is practical and outperforms the traditional approach. Jianmin Wang 0001, Raymond K. Wong 0001, Jianwei Ding, Qinlong Guo, Lijie Wen 0001 |
IEEE Trans. Serv. Comput. | 4 |
| 2012 | On Recommendation of Process Mining AlgorithmsabstractWhile many process mining algorithms have been proposed recently, there does not exist a widely-accepted benchmark to evaluate and compare these process mining algorithms. As a result, it can be difficult to choose a suitable process mining algorithm for a given enterprise or application domain. Some recent benchmark systems have been developed and proposed to address this issue. However, evaluating available process mining algorithms against a large set of business models (e.g., in a large enterprise) can be computationally expensive, tedious and time-consuming. This paper proposes a novel framework that can efficiently select the process mining algorithms that are most suitable for a given model set. In particular, it attemptsto investigate how we can avoid evaluating numerous process mining algorithms on all given process models. Jianmin Wang 0001, Raymond K. Wong 0001, Jianwei Ding, Qinlong Guo, Lijie Wen 0001 |
ICWS | 4 |