ACM Home Page
Please provide us with feedback. Feedback
Using minimum description length for process mining
Full text PdfPdf (382 KB)
Source
Symposium on Applied Computing archive
Proceedings of the 2009 ACM symposium on Applied Computing table of contents
Honolulu, Hawaii
SESSION: Data mining track table of contents
Pages 1451-1455  
Year of Publication: 2009
ISBN:978-1-60558-166-8
Authors
T. Calders  TU Eindhoven
C. W. Günther  TU Eindhoven
M. Pechenizkiy  TU Eindhoven
A. Rozinat  TU Eindhoven
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 52,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1529282.1529606
What is a DOI?

ABSTRACT

In the field of process mining, the goal is to automatically extract process models from event logs. Recently, many algorithms have been proposed for this task. For comparing these models, different quality measures have been proposed. Most of these measures, however, have several disadvantages; they are model-dependent, assume that the model that generated the log is known, or need negative examples of event sequences. In this paper we propose a new measure, based on the minimal description length principle, to evaluate the quality of process models that does not have these disadvantages. To illustrate the properties of the new measure we conduct experiments and discuss the trade-off between model complexity and compression.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
 
5
J. Rissanen. Modelling by the shortest data description. Automatica, 14: 465--471, 1978.
 
6
 
7
Collaborative Colleagues:
T. Calders: colleagues
C. W. Günther: colleagues
M. Pechenizkiy: colleagues
A. Rozinat: colleagues