EDBT 2026 Demo / reviewers in the wild / expert
Thomas Chatain
dblp:41/5716
· DBLP profile ↗
8ranked-venue papers in the field
4as first author
5since 2021 · last 2024
0000-0002-1470-5074ORCID · corroborated
Domains — venue-derived; a paper can count in several
Business Process & Enterprise Data · 4 (2 first)Database Systems & Data Management · 3 (1 first)Other / Interdisciplinary · 1 (1 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Timed alignments with mixed moves
Neha Rino, Thomas Chatain |
Data Knowl. Eng. | 2 |
| 2022 | Timed AlignmentsabstractThe subject of this paper is to study conformance checking for timed models, that is, process models that consider both the sequence of events in a process as well as the timestamps at which each event is recorded. Time-aware process mining is a growing subfield of research, and as tools that seek to discover timing related properties in processes develop, so does the need for conformance checking techniques that can tackle time constraints and provide insightful quality measures for time-aware process models. In particular, one of the most useful conformance artefacts is the alignment, that is, finding the minimal changes necessary to correct a new observation to conform to a process model. In this paper, we set our problem of timed alignment and solve two cases each corresponding to a different metric over time processes. Thomas Chatain, Neha Rino |
ICPM | 1 |
| 2021 | An A*-Algorithm for Computing Discounted Anti-Alignments in Process MiningabstractProcess mining techniques aim at analyzing and monitoring processes through event data. Formal models like Petri nets serve as an effective representation of the processes. A central question in the field is to assess the conformance of a process model with respect to the real process executions. The notion of anti-alignment, which represents a model run that is as distant as possible to the process executions, has been demonstrated to be crucial to measure precision of models. However, the only known algorithm for computing anti-alignments has a high complexity, which prevents it from being applied on real-life problem instances. In this paper we propose a novel algorithm for computing anti-alignments, based on the well-known graph-based $A^{*}$ scheme. By introducing a discount factor in the edit distance used for the search of anti-alignments, we obtain the first efficient algorithm to approximate them. We show how this approximation is quite accurate in practice, by comparing it with the optimal results for small instances where the optimal algorithm can also compute anti-alignments. Finally, we compare the obtained precision metric with respect to the state-of-the-art metrics in the literature for real-life examples. Mathilde Boltenhagen, Thomas Chatain, Josep Carmona 0001 |
ICPM | 2 |
| 2021 | Model-based trace variant analysis of event logs
Mathilde Boltenhagen, Thomas Chatain, Josep Carmona 0001 |
Inf. Syst. | 2 |
| 2021 | Anti-alignments - Measuring the precision of process models and event logs
Thomas Chatain, Mathilde Boltenhagen, Josep Carmona 0001 |
Inf. Syst. | 1 |
| 2017 | Aligning Modeled and Observed Behavior: A Compromise Between Computation Complexity and Quality
Boudewijn F. van Dongen, Josep Carmona 0001, Thomas Chatain, Farbod Taymouri |
CAiSE | 3 |
| 2017 | Alignment-Based Trace Clustering
Thomas Chatain, Josep Carmona 0001, Boudewijn F. van Dongen |
ER | 1 |
| 2007 | On the well-foundedness of adequate orders used for construction of complete unfolding prefixes
Thomas Chatain, Victor Khomenko |
Inf. Process. Lett. | 1 |