A New Trace Clustering Algorithm Based on Context in Process Mining

4Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In process mining, trace clustering is an important technique that at-tracts the attention of researchers to solve the large and complex volume of event logs. Traditional trace clustering often uses available data mining algorithms which do not exploit the characteristic of processes. In this study, we propose a new trace clustering algorithm, especially for the process mining, based on the using trace context. The proposed clustering algorithm can automatic detects the number of clusters, and it does not need a convergence iteration like traditional ones like K-means. The algorithm takes two loops over the input to generate the clusters, thus the complexity is greatly reduced. Experimental results show that our method also has good results when compared to traditional methods.

Cite

CITATION STYLE

APA

Bui, H. N., Nguyen, T. T., Nguyen, T. C., & Ha, Q. T. (2018). A New Trace Clustering Algorithm Based on Context in Process Mining. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11103 LNAI, pp. 644–657). Springer Verlag. https://doi.org/10.1007/978-3-319-99368-3_50

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free