An Entropic Relevance Measure for Stochastic Conformance Checking in Process Mining

TL;DR

This paper introduces an entropic relevance measure for stochastic conformance checking in process mining, quantifying how well a process model explains event logs by measuring the average compression cost of traces, addressing both precision and recall.

Contribution

It proposes a novel entropic relevance measure that incorporates stochastic information and is computationally efficient for industrial-scale process mining.

Findings

The measure effectively captures conformance by penalizing unmatched traces.

It is computable in linear time relative to log size.

Evaluation shows feasibility for industrial applications.

Abstract

Given an event log as a collection of recorded real-world process traces, process mining aims to automatically construct a process model that is both simple and provides a useful explanation of the traces. Conformance checking techniques are then employed to characterize and quantify commonalities and discrepancies between the log's traces and the candidate models. Recent approaches to conformance checking acknowledge that the elements being compared are inherently stochastic - for example, some traces occur frequently and others infrequently - and seek to incorporate this knowledge in their analyses. Here we present an entropic relevance measure for stochastic conformance checking, computed as the average number of bits required to compress each of the log's traces, based on the structure and information about relative likelihoods provided by the model. The measure penalizes traces from the event log not captured by the model and traces described by the model but absent in the event log, thus addressing both precision and recall quality criteria at the same time. We further show that entropic relevance is computable in time linear in the size of the log, and provide evaluation outcomes that demonstrate the feasibility of using the new approach in industrial settings.