Selecting Optimal Trace Clustering Pipelines with Meta-learning

Trace clustering has been extensively used to discover aspects of the data from event logs. Process Mining techniques guide the identification of sub-logs by grouping traces with similar behaviors, producing more understandable models and improving conformance indicators. Nevertheless, little attent...

Full description

Saved in:
Bibliographic Details
Published inIntelligent Systems Vol. 13653; pp. 150 - 164
Main Authors Tavares, Gabriel Marques, Barbon Junior, Sylvio, Damiani, Ernesto, Ceravolo, Paolo
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2022
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Online AccessGet full text
ISBN9783031216855
3031216857
ISSN0302-9743
1611-3349
DOI10.1007/978-3-031-21686-2_11

Cover

More Information
Summary:Trace clustering has been extensively used to discover aspects of the data from event logs. Process Mining techniques guide the identification of sub-logs by grouping traces with similar behaviors, producing more understandable models and improving conformance indicators. Nevertheless, little attention has been posed to the relationship among event log properties, the pipeline of encoding and clustering algorithms, and the quality of the obtained outcome. The present study contributes to the understanding of the aforementioned relationships and provides an automatic selection of a proper combination of algorithms for clustering a given event log. We propose a Meta-Learning framework to recommend the most suitable pipeline for trace clustering, which encompasses the encoding method, clustering algorithm, and its hyperparameters. Our experiments were conducted using a thousand event logs, four encoding techniques, and three clustering methods. Results indicate that our framework sheds light on the trace clustering problem and can assist users in choosing the best pipeline considering their environment.
ISBN:9783031216855
3031216857
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-031-21686-2_11