Decomposing Petri nets for process mining: A generic approach
The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Lecture Notes in Artificial Intelligence
Brézillon, P., & Bouquet, P. (1999) · Cited by 7,473
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
Karypis, G., & Kumar, V. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595287997 · Cited by 5,762
An Efficient Heuristic Procedure for Partitioning Graphs
Kernighan, B. W., & Lin, S. (1970) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1970.tb01770.x · Cited by 5,305 · cited 1×
“Given a causal graph, we can view the decomposition as a graph partitioning problem [32, 42–44].”
Background(2011) · Cited by 5,203
van der Aalst, W. M. P., ter Hofstede, A. H. M., Kiepuszewski, B., & Barros, A. P. (2003) · Distributed and Parallel Databases · doi:10.1023/a:1022883727209 · Cited by 2,613
Self-citationHand, D. J., Mannila, H., & Smyth, P. (2001) · Cited by 2,581
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 · cited 6×
“An example of a discovery algorithm is the α algorithm [57] which we will refer to as discα( ).”
BackgroundMethodInfluentialSelf-citationAn overview of workflow management: From process modeling to workflow automation infrastructure
Georgakopoulos, D., Hornick, M. F., & Sheth, A. (1995) · Distributed and Parallel Databases · doi:10.1007/bf01277643 · Cited by 1,812
Process Mining: Discovery, Conformance and Enhancement of Business Processes
van der Aalst, W. M. P. (2011) · CERN Document Server (European Organization for Nuclear Research) · doi:10.1007/978-3-642-19345-3 · Cited by 1,725
Self-citationSmith, A. (2002) · Artificial Intelligence in Medicine · doi:10.1016/s0933-3657(02)00058-1 · Cited by 1,700
Business Process Management : Concepts, Languages, Architectures
Weske, M., & GmbH, S.-V. (2007) · doi:10.1007/978-3-540-73522-9 · Cited by 1,660 · cited 1×
“In contrast, Business Process Management (BPM) and Workflow Management (WFM) approaches focus on the analysis and improvement of end-to-end processes using knowledge from information technology and knowledge from management sciences [29, 65].”
The World’s Technological Capacity to Store, Communicate, and Compute Information
Hilbert, M., & López, P. (2011) · Science · doi:10.1126/science.1200970 · Cited by 1,643 · cited 1×
“Industry reports such as [40] and scientific studies [35] describe the incredible growth of data.”
Backgroundvan der Aalst, W., Adriansyah, A., de Medeiros, A. K. A., Arcieri, F., Baier, T., Blickle, T., Bose, J. C., van den Brand, P., Brandtjen, R., Buijs, J., et al. (2012) · Lecture Notes in Business Information Processing · doi:10.1007/978-3-642-28108-2_19 · Cited by 1,210 · cited 2×
“The growing interest in process mining is illustrated by the Process Mining Manifesto [22] recently released by the IEEE Task Force on Process Mining.”
MethodSelf-citationParallel mining of association rules
Agrawal, R., & Shafer, J. C. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553164 · Cited by 1,064 · cited 1×
“, distributed classification, distributed clustering, and distributed association rule mining [5].”
BackgroundHand, D. J. (2007) · Drug Safety · doi:10.2165/00002018-200730070-00010 · Cited by 1,044
Fuzzy Mining – Adaptive Process Simplification Based on Multi-perspective Metrics
Günther, C. W., & van der Aalst, W. M. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-75183-0_24 · Cited by 890 · cited 1×
“the heuristic miner [64], and the fuzzy miner [32] scan the event log to see how”
MethodSelf-citationDiscovering 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 · cited 5×
“, heuristics [25, 51], inductive logic programming [31], state-based regions [7, 23, 49], language-based regions [15, 52], and genetic algorithms [43].”
BackgroundInfluentialParsons, S. (2004) · The Knowledge Engineering Review · doi:10.1017/s0269888904220203 · Cited by 520
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 · cited 9×
“This becomes evident when considering genetic process discovery techniques [8, 12].”
BackgroundMethodInfluentialSelf-citationProcess mining: a two-step approach to balance between underfitting and overfitting
van der Aalst, W. M. P., Rubin, V., Verbeek, H. M. W., van Dongen, B. F., Kindler, E., & Günther, C. (2008) · Software & Systems Modeling · doi:10.1007/s10270-008-0106-z · Cited by 456 · cited 6×
“, heuristics [20, 64], inductive logic programming [30], state-based regions [17, 51, 58], language-based regions [9, 61], and genetic algorithms [8].”
BackgroundMethodInfluentialRozinat, A., & van der Aalst, W. M. P. (2006) · Lecture Notes in Computer Science · doi:10.1007/11841760_33 · Cited by 285 · cited 1×
“, size of order, age of patient, or type of customer), then these local alignments can be used for decision mining [48].”
BackgroundSelf-citationRobust Process Discovery with Artificial Negative Events
Goedertier, S., Martens, D., Vanthienen, J., & Baesens, B. (2009) · Journal of Machine Learning Research · doi:10.5555/1577069.1577113 · Cited by 223
Auditing 2.0: Using Process Mining to Support Tomorrow's Auditor
van der Aalst, W. M. P., van Hee, K. M., van der Werf, J. M., & Verdonk, M. (2010) · Computer · doi:10.1109/mc.2010.61 · Cited by 162 · cited 2×
“Conformance checking can be used to evaluate the quality of discovered processes but can also be used for auditing purposes [59].”
BackgroundSelf-citationTowards Robust Conformance Checking
Adriansyah, A., van Dongen, B. F., & van der Aalst, W. M. P. (2011) · Lecture notes in business information processing · doi:10.1007/978-3-642-20511-8_11 · Cited by 153 · cited 2×
“Dozens of process discovery [1, 8, 9, 14, 33, 16, 23, 24, 27, 35, 48, 59, 63, 64] and conformance checking [5, 10, 11, 13, 21, 28, 35, 50, 51, 57, 62] approaches have been proposed in literature.”
BackgroundDistributed Data Mining on Grids: Services, Tools, and Applications
Cannataro, M., Congiusta, A., Pugliese, A., Talia, D., & Trunfio, P. (2004) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2004.836890 · Cited by 139 · cited 1×
“Most data mining techniques can be distributed [15], e.”
BackgroundA robust F-measure for evaluating discovered process models
Weerdt, J. D., Backer, M. D., Vanthienen, J., & Baesens, B. (2011) · IEEE Symposium on Computational Intelligence and Data Mining (CIDM) · doi:10.1109/cidm.2011.5949428 · Cited by 126 · cited 1×
“However, in principle other techniques such as the ones described in [14, 21, 24, 30, 49] can be used.”
MethodQuantitative models of cohesion and coupling in software
Dhama, H. S. (1995) · Journal of Systems and Software · doi:10.1016/0164-1212(94)00128-a · Cited by 92 · cited 1×
“Some of the notions in graph partitioning are related to “cohesion and coupling” in software development [30].”
BackgroundSBV-Cut: Vertex-cut based graph partitioning using structural balance vertices
Kim, M., & Candan, K. S. (2011) · Data & Knowledge Engineering · doi:10.1016/j.datak.2011.11.004 · Cited by 91 · cited 1×
“For example, in [44] a vertex-cut based graph partitioning algorithm is proposed ensuring the balance of the resulting partitions while simultaneously minimizing the number of vertices that are cut (and thus replicated).”
BackgroundDecomposing Process Mining Problems Using Passages
van der Aalst, W. M. P. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31131-4_5 · Cited by 74 · cited 8×
“The notion of “passages” defined in [53, 55] provides an alternative approach to decompose such a graph.”
BackgroundMethodResultInfluentialUsing minimum description length for process mining
Calders, T., Günther, C., Pechenizkiy, M., & Rozinat, A. (2009) · ACM Symposium on Applied Computing · doi:10.1145/1529282.1529606 · Cited by 64 · cited 1×
“However, in principle other techniques such as the ones described in [14, 21, 24, 30, 49] can be used.”
MethodEnhancing precision in Process Conformance: Stability, confidence and severity
Muñoz-Gama, J., & Carmona, J. (2011) · IEEE Symposium on Computational Intelligence and Data Mining (CIDM) · doi:10.1109/cidm.2011.5949451 · Cited by 63 · cited 5×
“This alignment can be used for computing precision and generalization [43, 60].”
BackgroundMethodInfluentialDistributed Process Discovery and Conformance Checking
van der Aalst, W. M. P. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28872-2_1 · Cited by 47 · cited 4×
“Most algorithms are linear in the size of the event log and exponential in the number of different activities [54].”
BackgroundMethodInfluential
Cited by
Automated 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
Conformance checking based on multi-perspective declarative process models
Burattin, A., Maggi, F. M., & Sperduti, A. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.08.040 · Cited by 178
“…the art examples of these approaches are reported in (Cook & Wolf, 1999; Rozinat & van der Aalst, 2008; Adriansyah et al., 2011; de Leoni & van der Aalst, 2013; Mannhardt et al., 2014; van der Aalst, 2012, 2013; de Leoni et al., 2014b; Munoz-Gama et al., 2014; Knuplesch et al., 2010; Awad et al.,…”
BackgroundMethodInfluential
Metadata
- Authors
- van der Aalst, W. M. P.
- Venue
- Distributed and Parallel Databases
- Published
- 2013-07-20
- Volume
- 31
- Issue
- 4
- Pages
- 471-507
- ISSN
- 0926-8782 (ISSN-L)
- 1573-7578
- OpenAlex
- W2116056094
- Cited by
- 193
- References
- 33
- FWCI
- 44.54
- 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
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.