IVIlya Verenich

Ilya Verenich

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Ilya Verenich has a total of 17 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Top Cited Papers
    Open Access

    Survey and Cross-benchmark Comparison of Remaining Time Prediction Methods in Business Process Monitoring

    by Ilya Verenich, Marlon Dumas, Marcello La Rosa, Fabrizio Maria Maggi, Irene Teinemaa

    Predictive business process monitoring methods exploit historical process execution logs to generate predictions about running instances (called cases) of a business process, such as the prediction of the outcome, next activity, or remaining cycle time of a given process case. These insights could be used to support operational managers in taking remedial actions as business processes unfold, e.g., shifting resources from one case onto another to ensure the latter is completed on time. A number of methods to tackle the remaining cycle time prediction problem have been proposed in the literature. However, due to differences in their experimental setup, choice of datasets, evaluation measures, and baselines, the relative merits of each method remain unclear. This article presents a systematic literature review and taxonomy of methods for remaining time prediction in the context of business processes, as well as a cross-benchmark comparison of 16 such methods based on 17 real-life datasets originating from different industry domains.


  • Predicting process performance: A white‐box approach based on process models

    by Ilya Verenich, Marlon Dumas, Marcello La Rosa, Hoang Nguyen

    Predictive business process monitoring methods exploit historical process execution logs to provide predictions about running instances of a process. These predictions enable process workers and managers to preempt performance issues or compliance violations. A number of approaches have been proposed to predict quantitative process performance indicators for running instances of a process, including remaining cycle time, cost, or probability of deadline violation. However, these approaches adopt a black‐box approach, insofar as they predict a single scalar value without decomposing this prediction into more elementary components. In this paper, we propose a white‐box approach to predict performance indicators of running process instances. The key idea is to first predict the performance indicator at the level of activities and then to aggregate these predictions at the level of a process instance by means of flow analysis techniques. The paper develops this idea in the context of predicting the remaining cycle time of ongoing process instances. The proposed approach has been evaluated on real‐life event logs and compared against several baselines.


  • Predictive Process Monitoring in Apromore

    by Ilya Verenich, Stanislav Mõškovski, Simon Raboczi, Marlon Dumas, Marcello La Rosa, Fabrizio Maria Maggi


  • Open Access

    Survey and cross-benchmark comparison of remaining time prediction methods in business process monitoring

    by Ilya Verenich, Marlon Dumas, Marcello La Rosa, Fabrizio Maggi, Irene Teinemaa

    Predictive business process monitoring methods exploit historical process execution logs to generate predictions about running instances (called cases) of a business process, such as the prediction of the outcome, next activity or remaining cycle time of a given process case. These insights could be used to support operational managers in taking remedial actions as business processes unfold, e.g. shifting resources from one case onto another to ensure this latter is completed on time. A number of methods to tackle the remaining cycle time prediction problem have been proposed in the literature. However, due to differences in their experimental setup, choice of datasets, evaluation measures and baselines, the relative merits of each method remain unclear. This article presents a systematic literature review and taxonomy of methods for remaining time prediction in the context of business processes, as well as a cross-benchmark comparison of 16 such methods based on 16 real-life datasets originating from different industry domains.

  • Open Access

    White-box prediction of process performance indicators via flow analysis

    by Ilya Verenich, Hoang Nguyen, Marcello La Rosa, Marlon Dumas

    Predictive business process monitoring methods exploit historical process execution logs to provide predictions about running instances of a process, which enable process workers and managers to preempt performance issues or compliance violations. A number of approaches have been proposed to predict quantitative process performance indicators, such as remaining cycle time, cost, or probability of deadline violation. However, these approaches adopt a black-box approach, insofar as they predict a single scalar value without decomposing this prediction into more elementary components. In this paper, we propose a white-box approach to predict performance indicators of running process instances. The key idea is to first predict the performance indicator at the level of activities, and then to aggregate these predictions at the level of a process instance by means of flow analysis techniques. The paper specifically develops this idea in the context of predicting the remaining cycle time of ongoing process instances. The proposed approach has been evaluated on four real-life event logs and compared against several baselines.


  • Top Cited Papers

    Predictive Business Process Monitoring with LSTM Neural Networks

    by Niek Tax, Ilya Verenich, Marcello La Rosa, Marlon Dumas


  • Open Access

    Predictive Business Process Monitoring with LSTM Neural Networks

    by Niek Tax, Ilya Verenich, Marcello La Rosa, Marlon Dumas

    Predictive business process monitoring methods exploit logs of completed cases of a process in order to make predictions about running cases thereof. Existing methods in this space are tailor-made for specific prediction tasks. Moreover, their relative accuracy is highly sensitive to the dataset at hand, thus requiring users to engage in trial-and-error and tuning when applying them in a specific setting. This paper investigates Long Short-Term Memory (LSTM) neural networks as an approach to build consistently accurate models for a wide range of predictive process monitoring tasks. First, we show that LSTMs outperform existing techniques to predict the next event of a running case and its timestamp. Next, we show how to use models for predicting the next task in order to predict the full continuation of a running case. Finally, we apply the same approach to predict the remaining time, and show that this approach outperforms existing tailor-made methods.


  • Complex Symbolic Sequence Clustering and Multiple Classifiers for Predictive Process Monitoring

    by Ilya Verenich, Marlon Dumas, Marcello La Rosa, Fabrizio Maria Maggi, Chiara Di Francescomarino


  • Minimizing Overprocessing Waste in Business Processes via Predictive Activity Ordering

    by Ilya Verenich, Marlon Dumas, Marcello La Rosa, Fabrizio Maria Maggi, Chiara Di Francescomarino


  • Open Access

    Combining Propensity and Influence Models for Product Adoption Prediction

    by Ilya Verenich, Riivo Kikas, Marlon Dumas, Dmitri Melnikov

    This paper studies the problem of selecting users in an online social network for targeted advertising so as to maximize the adoption of a given product. In previous work, two families of models have been considered to address this problem: direct targeting and network-based targeting. The former approach targets users with the highest propensity to adopt the product, while the latter approach targets users with the highest influence potential – that is users whose adoption is most likely to be followed by subsequent adoptions by peers. This paper proposes a hybrid approach that combines a notion of propensity and a notion of influence into a single utility function. We show that targeting a fixed number of high-utility users results in more adoptions than targeting either highly influential users or users with high propensity