Genetic process mining: an experimental evaluation
Open accessThe DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Abstract
One of the aims of process mining is to retrieve a process model from an event log. The discovered models can be used as objective starting points during the deployment of process-aware information systems (Dumas et al., eds., Process-Aware Information Systems: Bridging People and Software Through Process Technology. Wiley, New York, 2005) and/or as a feedback mechanism to check prescribed models against enacted ones. However, current techniques have problems when mining processes that contain non-trivial constructs and/or when dealing with the presence of noise in the logs. Most of the problems happen because many current techniques are based on local information in the event log. To overcome these problems, we try to use genetic algorithms to mine process models. The main motivation is to benefit from the global search performed by this kind of algorithms. The non-trivial constructs are tackled by choosing an internal representation that supports them. The problem of noise is naturally tackled by the genetic algorithm because, per definition, these algorithms are robust to noise. The main challenge in a genetic approach is the definition of a good fitness measure because it guides the global search performed by the genetic algorithm. This paper explains how the genetic algorithm works. Experiments with synthetic and real-life logs show that the fitness measure indeed leads to the mining of process models that are complete (can reproduce all the behavior in the log) and precise (do not allow for extra behavior that cannot be derived from the event log). The genetic algorithm is implemented as a plug-in in the ProM framework.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Petri nets: Properties, analysis and applications
Murata, T. (1989) · Proceedings of the IEEE · doi:10.1109/5.24143 · Cited by 10,606
Introduction to Evolutionary Computing
Eiben, A. E., & Smith, J. E. (2003) · Natural Computing Series · doi:10.1007/978-3-662-05094-1 · Cited by 4,176
A calculus of mobile processes, I
Milner, R., Parrow, J., & Walker, D. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90008-4 · Cited by 2,845
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
Self-citationA calculus of mobile processes, II
Milner, R., Parrow, J., & Walker, D. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90009-5 · Cited by 1,696
(2004) · Lecture Notes in Computer Science · doi:10.1007/b98643 · Cited by 957
Inductive Inference: Theory and Methods
Angluin, D., & Smith, C. H. (1983) · ACM Computing Surveys · doi:10.1145/356914.356918 · Cited by 887
Discovering models of software processes from event-based data
Cook, J. E., & Wolf, A. L. (1998) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/287000.287001 · Cited by 870
Complexity of automaton identification from given data
Gold, E. M. (1978) · Information and Control · doi:10.1016/s0019-9958(78)90562-4 · Cited by 771
Process mining: a research agenda
van der Aalst, W. M. P., & Weijters, A. J. M. M. (2004) · Computers in Industry · doi:10.1016/j.compind.2003.10.001 · Cited by 652
Self-citationProcess-aware information systems: bridging people and software through process technology
Dumas, M., van der Aalst, W. M. P., & ter Hofstede, A. T. (2006) · Choice Reviews Online · doi:10.5860/choice.43-4070 · Cited by 619
Advances in Minimum Description Length: Theory and Applications
Grünwald, P., Myung, I. J., & Pitt, M. A. (2005) · Data Archiving and Networked Services (DANS) · Cited by 408
Discovering expressive process models by clustering log traces
Greco, G., Guzzo, A., Pontieri, L., & Sacca, D. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.123 · Cited by 321
Mining Social Networks: Uncovering Interaction Patterns in Business Processes
van der Aalst, W. M. P., & Song, M. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-25970-1_16 · Cited by 254
Self-citationInductive inference, DFAs, and computational complexity
Pitt, L. (1989) · Lecture Notes in Computer Science · doi:10.1007/3-540-51734-0_50 · Cited by 223
Conformance Testing: Measuring the Fit and Appropriateness of Event Logs and Process Models
Rozinat, A., & van der Aalst, W. M. P. (2006) · Lecture Notes in Computer Science · doi:10.1007/11678564_15 · Cited by 166
Self-citationDiscovering models of behavior for concurrent workflows
Cook, J., Du, Z., Liu, C., & Wolf, A. L. (2003) · Computers in Industry · doi:10.1016/j.compind.2003.10.005 · Cited by 94
Mining Expressive Process Models by Clustering Workflow Traces
Greco, G., Guzzo, A., Pontieri, L., & Saccà, D. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24775-3_8 · Cited by 67
A Data Warehouse for Workflow Logs
Eder, J., Olivotto, G. E., & Gruber, W. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45785-2_1 · Cited by 54
Petri net modeling of high-order genetic systems using grammatical evolution
Moore, J. H., & Hahn, L. W. (2003) · Biosystems · doi:10.1016/s0303-2647(03)00142-4 · Cited by 44
A machine learning approach to understand business processes
Măruşter, L. (2003) · Data Archiving and Networked Services (DANS) · doi:10.6100/ir568241 · Cited by 29
Evolving petri nets to represent metabolic pathways
Nummela, J. A., & Julstrom, B. A. (2005) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1068009.1068361 · Cited by 20
Grammatical Evolution for the Discovery of Petri Net Models of Complex Genetic Systems
Moore, J. H., & Hahn, L. W. (2003) · Lecture notes in computer science · doi:10.1007/3-540-45110-2_139 · Cited by 12
Moore, J. H., & Hahn, L. W. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24653-4_7 · Cited by 10
Petri net controller synthesis using genetic search
Bourdeaud’huy, T., & Yim, P. (2005) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.2002.1168030 · Cited by 5
Cited by
Process mining in healthcare: A literature review
Rojas, E., Munoz-Gama, J., Sepúlveda, M., & Capurro, D. (2016) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2016.04.007 · Cited by 613
Process Mining: Overview and Opportunities
van der Aalst, W. (2012) · ACM Transactions on Management Information Systems · doi:10.1145/2229156.2229157 · Cited by 487
Self-citationAutomated Discovery of Process Models from Event Logs: Review and Benchmark
Augusto, A., Conforti, R., Dumas, M., Rosa, M. L., Maggi, F. M., Marrella, A., Mecella, M., & Soo, A. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2841877 · Cited by 438
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
Self-citationWanna improve process mining results?
Bose, R. P. J. C., Mans, R. S., & van der Aalst, W. M. P. (2013) · 2013 IEEE Symposium on Computational Intelligence and Data Mining (CIDM) · doi:10.1109/cidm.2013.6597227 · Cited by 192
Metadata
- Authors
- de Medeiros, A. K. A., Weijters, A. J. M. M., & van der Aalst, W. M. P.
- Venue
- Data Mining and Knowledge Discovery
- Published
- 2007-01-31
- Volume
- 14
- Issue
- 2
- Pages
- 245-304
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W2100175929
- Cited by
- 490
- References
- 25
- FWCI
- 44.31
- Type
- journal article
- Language
- en
- Open access
- hybrid
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
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.