# Enhancing Stochastic Petri Net-based Remaining Time Prediction using k-Nearest Neighbors

arXiv: https://arxiv.org/abs/2206.13109 · HTML: https://mlsanity.com/paper/2206.13109/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 8 of its 29 references that are in the map.
- First posted on arXiv 27 Jun 2022.

## Builds on (most cited first, 8 of 8)

- [Predictive Business Process Monitoring with LSTM Neural Networks](https://mlsanity.com/paper/1612.02130/) (2016)
- [Predicting Process Behaviour using Deep Learning](https://mlsanity.com/paper/1612.04600/) (2016)
- [Survey and cross-benchmark comparison of remaining time prediction methods in business process monitoring](https://mlsanity.com/paper/1805.02896/) (2018)
- [ProcessTransformer: Predictive Business Process Monitoring with Transformer Network](https://mlsanity.com/paper/2104.00721/) (2021)
- [Process Mining for Python (PM4Py): Bridging the Gap Between Process- and Data Science](https://mlsanity.com/paper/1905.06169/) (2019)
- [Predictive Business Process Monitoring via Generative Adversarial Nets: The Case of Next Event Prediction](https://mlsanity.com/paper/2003.11268/) (2020)
- [Clustering-Based Predictive Process Monitoring](https://mlsanity.com/paper/1506.01428/) (2015)
- [Time and Activity Sequence Prediction of Business Process Instances](https://mlsanity.com/paper/1602.07566/) (2016)

## Built on by (most cited first, 1 of 1)

- [A Survey on Event Prediction Methods from a Systems Perspective: Bringing Together Disparate Research Areas](https://mlsanity.com/paper/2302.04018/) (2023)

## Abstract (arXiv)

Reliable remaining time prediction of ongoing business processes is a highly relevant topic. One example is order delivery, a key competitive factor in e.g. retailing as it is a main driver of customer satisfaction. For realising timely delivery, an accurate prediction of the remaining time of the delivery process is crucial. Within the field of process mining, a wide variety of remaining time prediction techniques have already been proposed. In this work, we extend remaining time prediction based on stochastic Petri nets with generally distributed transitions with k-nearest neighbors. The k-nearest neighbors algorithm is performed on simple vectors storing the time passed to complete previous activities. By only taking a subset of instances, a more representative and stable stochastic Petri Net is obtained, leading to more accurate time predictions. We discuss the technique and its basic implementation in Python and use different real world data sets to evaluate the predictive power of our extension. These experiments show clear advantages in combining both techniques with regard to predictive power.