Process Mining
From MaRDI portal
Publication:3084368
DOI10.1007/978-3-642-19345-3zbMath1216.68016OpenAlexW4230145224WikidataQ110527192 ScholiaQ110527192MaRDI QIDQ3084368
Publication date: 16 March 2011
Full work available at URL: https://doi.org/10.1007/978-3-642-19345-3
Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (40)
Balanced multi-perspective checking of process conformance ⋮ Business Process Compliance Using Reference Models of Law ⋮ Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues ⋮ Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues ⋮ Sequential pattern mining for ICT risk assessment and management ⋮ Discovering Block-Structured Process Models from Event Logs - A Constructive Approach ⋮ Cooperative decision-making to minimize biased perceived value effect on business process decisions using partially observable Markov decision processes ⋮ Revising history for cost-informed process improvement ⋮ Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues ⋮ Process Mining Reloaded: Event Structures as a Unified Representation of Process Models and Event Logs ⋮ Process Discovery Using Localized Events ⋮ Asymmetric hidden Markov models ⋮ Discovering Petri nets including silent transitions. A repairing approach based on structural patterns ⋮ Business analytics in service operations—Lessons from healthcare operations ⋮ On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets ⋮ Data-aware process discovery for malware detection: an empirical study ⋮ Hardness Results for the Synthesis of b-bounded Petri Nets ⋮ Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets ⋮ Discovering workflow nets of concurrent iterative processes ⋮ Computing alignments with maximum synchronous moves via replay in coordinate planes ⋮ Unnamed Item ⋮ Model-based fault identification of discrete event systems using partially observed Petri nets ⋮ Process mining: realization and optimization of process discovery algorithm ⋮ Improving active Mealy machine learning for protocol conformance testing ⋮ On the parameterized complexity of the synthesis of Boolean nets with restricted place environments ⋮ Aggregating Causal Runs into Workflow Nets ⋮ Ordered subtree mining via transactional mapping using a structure-preserving tree database schema ⋮ Process Model Discovery: A Method Based on Transition System Decomposition ⋮ Discovering Block-Structured Process Models from Incomplete Event Logs ⋮ A Programming Language for Spatial Distribution of Net Systems ⋮ The 4C Spectrum of Fundamental Behavioral Relations for Concurrent Systems ⋮ A survey on concept drift adaptation ⋮ Multidisciplinary pattern recognition applications: a review ⋮ Scheduling surgery groups considering multiple downstream resources ⋮ Causal Nets: A Modeling Language Tailored towards Process Discovery ⋮ Anti-alignments in Conformance Checking – The Dark Side of Process Models ⋮ Rough Sets: From Rudiments to Challenges ⋮ The Complexity of Synthesis of b-Bounded Petri Nets ⋮ Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable ⋮ Synthesis of Petri nets with restricted place-environments: classical and parameterized
Uses Software
This page was built for publication: Process Mining