@inproceedings{65bf728d16474015b7c3757c84b2ed33,
title = "Avoiding over-fitting in ILP-based process discovery",
abstract = "The aim of process discovery is to discover a process model based on business process execution data, recorded in an event log. One of several existing process discovery techniques is the ILP-based process discovery algorithm. The algorithm is able to unravel complex process structures and provides formal guarantees w.r.t. the model discovered, e.g., the algorithm guarantees that a discovered model describes all behavior present in the event log. Unfortunately the algorithm is unable to cope with exceptional behavior present in event logs. As a result, the application of ILP-based process discovery techniques in everyday process discovery practice is limited. This paper addresses this problem by proposing a filtering technique tailored towards ILP-based process discovery. The technique helps to produce process models that are less over-fitting w.r.t. the event log, more understandable, and more adequate in capturing the dominant behavior present in the event log. The technique is implemented in the ProM framework. Keywords: Process mining Process discovery Integer linear programming Filtering",
author = "{Zelst, van}, S.J. and {Dongen, van}, B.F. and {van der Aalst}, W.M.P.",
year = "2015",
doi = "10.1007/978-3-319-23063-4_10",
language = "English",
isbn = "978-3-319-23062-7",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "163--171",
editor = "H.R. Motahari-Nezhad and J. Recker and M. Weidlich",
booktitle = "Business Process Management",
address = "Germany",
}