The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Discovering expressive process models by clustering log traces
Abstract
Process mining techniques have recently received notable attention in the literature; for their ability to assist in the (re)design of complex processes by automatically discovering models that explain the events registered in some log traces provided as input. Following this line of research, the paper investigates an extension of such basic approaches, where the identification of different variants for the process is explicitly accounted for, based on the clustering of log traces. Indeed, modeling each group of similar executions with a different schema allows us to single out "conformant" models, which, specifically, minimize the number of modeled enactments that are extraneous to the process semantics. Therefore, a novel process mining framework is introduced and some relevant computational issues are deeply studied. As finding an exact solution to such an enhanced process mining problem is proven to require high computational costs, in most practical cases, a greedy approach is devised. This is founded on an iterative, hierarchical, refinement of the process model, where, at each step, traces sharing similar behavior patterns are clustered together and equipped with a specialized schema. The algorithm guarantees that each refinement leads to an increasingly sound mDdel, thus attaining a monotonic search. Experimental results evidence the validity of the approach with respect to both effectiveness and scalability.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
Agrawal, R., & Srikant, R. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380415 · Cited by 5,155
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · ACM SIGMOD Record · doi:10.1145/170036.170072 · Cited by 4,551
THE APPLICATION OF PETRI NETS TO WORKFLOW MANAGEMENT
van der Aalst, W. M. P. (1998) · Journal of Circuits Systems and Computers · doi:10.1142/s0218126698000043 · Cited by 2,716
Workflow mining: discovering process models from event logs
van der Aalst, W., Weijters, T., & Maruster, L. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.47 · Cited by 2,203
FreeSpan: frequent pattern-projected sequential pattern mining
Han, J., Pei, J., Mortazavi-Asl, B., Chen, Q., Dayal, U., & Hsu, M.-C. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347167 · Cited by 808
Workflow Management: Models, Methods, and Systems
van der Aalst, W. M. P., & van Hee, K. (2002) · The MIT Press eBooks · doi:10.7551/mitpress/7301.001.0001 · Cited by 744
Workflow Management: Models, Methods, and Systems
van der Aalst, W. M. P., & van Hee, K. (2001) · Cited by 738
Cited by
Genetic process mining: an experimental evaluation
de Medeiros, A. K. A., Weijters, A. J. M. M., & van der Aalst, W. M. P. (2007) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-006-0061-7 · Cited by 490
Process Mining: Overview and Opportunities
van der Aalst, W. (2012) · ACM Transactions on Management Information Systems · doi:10.1145/2229156.2229157 · Cited by 487
Trace Clustering in Process Mining
Song, M., Günther, C. W., & van der Aalst, W. M. P. (2009) · Lecture Notes in Business Information Processing · doi:10.1007/978-3-642-00328-8_11 · Cited by 354
Towards comprehensive support for organizational mining
Song, M., & van der Aalst, W. M. P. (2008) · Decision Support Systems · doi:10.1016/j.dss.2008.07.002 · Cited by 347
Process mining techniques and applications – A systematic mapping study
Garcia, C. D. S., Meincheim, A., Faria Junior, E. R., Dallagassa, M. R., Sato, D. M. V., Carvalho, D. R., Santos, E. A. P., & Scalabrin, E. E. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.05.003 · Cited by 334
Metadata
- Authors
- Greco, G., Guzzo, A., Pontieri, L., & Sacca, D.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2006-08
- Volume
- 18
- Issue
- 8
- Pages
- 1010-1027
- ISSN
- 1041-4347 (ISSN-L)
- 1558-2191
- 2326-3865
- OpenAlex
- W2103226467
- Cited by
- 321
- References
- 17
- FWCI
- 21.42
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Discovering expressive process models by clustering log traces. https://app.cochat.ai/papers/10.1109/tkde.2006.123
- The paper
- Greco, G., Guzzo, A., Pontieri, L., & Sacca, D. (2006). Discovering expressive process models by clustering log traces. IEEE Transactions on Knowledge and Data Engineering. https://doi.org/10.1109/tkde.2006.123
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.