<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:media="http://search.yahoo.com/mrss/"><channel><title><![CDATA[Maxim Vidgof's Blog]]></title><description><![CDATA[Personal blog of Maxim Vidgof.]]></description><link>https://blog.vidgof.eu/</link><image><url>https://blog.vidgof.eu/favicon.png</url><title>Maxim Vidgof&apos;s Blog</title><link>https://blog.vidgof.eu/</link></image><generator>Ghost 5.77</generator><lastBuildDate>Sat, 16 May 2026 15:24:20 GMT</lastBuildDate><atom:link href="https://blog.vidgof.eu/rss/" rel="self" type="application/rss+xml"/><ttl>60</ttl><item><title><![CDATA[[HL] Automatic Resource Allocation in Business Processes: A Systematic Literature Survey]]></title><description><![CDATA[Automatic Resource Allocation in Business Processes: A Systematic Literature Survey]]></description><link>https://blog.vidgof.eu/hl-2024-01-30/</link><guid isPermaLink="false">65c5110f67f617b91ebbc428</guid><category><![CDATA[Highlight]]></category><category><![CDATA[Academic]]></category><dc:creator><![CDATA[Maxim Vidgof]]></dc:creator><pubDate>Tue, 30 Jan 2024 19:18:00 GMT</pubDate><content:encoded><![CDATA[<p>Luise Pufahl presented her SLR on resource allocation in business processes at <a href="https://www.weizenbaum-institut.de/?ref=blog.vidgof.eu" rel="noreferrer">Weizenbaum Institute</a> today!</p><figure class="kg-card kg-image-card"><img src="https://pbs.twimg.com/media/GFHQml2XoAAnN-I?format=jpg&amp;name=medium" class="kg-image" alt="Image" loading="lazy" width="1200" height="675"></figure><p>Resource allocation is a complex problem as resources can have different competences, capabilities and rights. So, together with her colleagues, she posed the question:&#x201C;What is the state-of-the-art of system-initiated resource allocation approaches for business processes?&#x201D;</p><p>Some interesting findings:<br>- Papers may use models or execution data but rarely both <br>- Most papers decide based on previous performance and workload, but some include other interesting perspectives<br>- Most papers don&#x2019;t deliver a prototypical implementation!</p><p>- Rule-based solutions are most used and have lowest execution cost,yet also propose the worst strategies<br>- Exact algorithms do the opposite: globally optimal solutions at the price of prohibitively long computations<br>- Approaches based on ML or (meta-)heuristics are in between</p><p>They also identified future work directions: <br>- Leveraging more execution data<br>- Exploring additional aspects of resource and task characteristics<br>- Increasing adaptability and flexibility of algorithms<br>- Benchmarking</p><p>Want to learn more? Then read the pre-print by Luise Pufahl, Sven Ihde, Fabian Stiehle, Mathias Weske &amp; Ingo Weber here: <a href="https://arxiv.org/abs/2107.07264?ref=blog.vidgof.eu">https://arxiv.org/abs/2107.07264</a></p><p>P.S. Arxiv currently has an older version of the pre-print but it will be updated soon.</p>]]></content:encoded></item><item><title><![CDATA[Coming soon]]></title><description><![CDATA[<p>This is Maxim Vidgof&apos;s Blog, a brand new site by Maxim Vidgof that&apos;s just getting started. Things will be up and running here shortly, but you can <a href="#/portal/">subscribe</a> in the meantime if you&apos;d like to stay up to date and receive emails when new</p>]]></description><link>https://blog.vidgof.eu/coming-soon/</link><guid isPermaLink="false">65b7e5f967f617b91ebbc159</guid><category><![CDATA[News]]></category><dc:creator><![CDATA[Maxim Vidgof]]></dc:creator><pubDate>Mon, 29 Jan 2024 17:52:57 GMT</pubDate><content:encoded><![CDATA[<p>This is Maxim Vidgof&apos;s Blog, a brand new site by Maxim Vidgof that&apos;s just getting started. Things will be up and running here shortly, but you can <a href="#/portal/">subscribe</a> in the meantime if you&apos;d like to stay up to date and receive emails when new content is published!</p>]]></content:encoded></item><item><title><![CDATA[[PotW] Explainable and Effective Process Remaining Time Prediction Using Feature-informed Cascade Prediction Model]]></title><description><![CDATA[Paper of the week: “Explainable and Effective Process Remaining Time Prediction Using Feature-informed Cascade Prediction Model”]]></description><link>https://blog.vidgof.eu/paper-of-the-week-2024-01-28/</link><guid isPermaLink="false">65b7ee7e67f617b91ebbc366</guid><category><![CDATA[Paper of the week]]></category><category><![CDATA[Academic]]></category><dc:creator><![CDATA[Maxim Vidgof]]></dc:creator><pubDate>Sun, 28 Jan 2024 20:00:00 GMT</pubDate><content:encoded><![CDATA[<p>Paper of the week: &#x201C;Explainable and Effective Process Remaining Time Prediction Using Feature-informed Cascade Prediction Model&#x201D; by Na Guo, Cong Liu, Caihong Li, Qingtian Zeng, Chun Ouyang, Qingzhi Liu, and Xixi Lu. Check it out at: <a href="https://ieeexplore.ieee.org/abstract/document/10399950?ref=blog.vidgof.eu">https://ieeexplore.ieee.org/abstract/document/10399950</a></p><p>Remaining time prediction is an important area of PPM as it allows to check if a running instance will meet the time constraints and to act timely. Deep learning models are generally applied due to their higher accuracy, however, at the cost of explainability.</p><p>To this end, the authors propose feature-informed cascade prediction framework. It uses a novel explainable automated feature selection strategy and a deep learning model that allows to correlate the effects between each input feature and its prediction results.</p><figure class="kg-card kg-image-card"><img src="https://pbs.twimg.com/media/GE9G_PpWQAAtq1E?format=jpg&amp;name=large" class="kg-image" alt="Image" loading="lazy" width="1334" height="881"></figure><p>First, the effect of each feature is evaluated in a systematic manner, resulting in a so-called incremental feature tree. The tree is pruned using a threshold, and a node with the smallest MAE has the best feature set on the path to it from the root. </p>
<!--kg-card-begin: html-->
<div style="text-align:center"><img src="https://pbs.twimg.com/media/GE9G_nRWgAAjBgD?format=jpg&amp;name=medium" style="max-width:50%"></div>
<!--kg-card-end: html-->
<p>Second, the feature-informed cascade prediction model is constructed. Each feature gets a separate layer, and layers are trained sequentially. The input sub-layer receives its feature and the output of the previous layer. The hidden sub-layer includes a neural network,e.g. LSTM. </p><figure class="kg-card kg-image-card"><img src="https://pbs.twimg.com/media/GE9G_7yXgAA0D-K?format=jpg&amp;name=large" class="kg-image" alt="Image" loading="lazy" width="1220" height="1220"></figure><p>In their evaluation on 8 real-life event logs, they show that FCPM performs better (lower MAE) than other approaches on most logs while having medium training time. Additionally, they showcase an end-to-end application scenario with a detailed case study. </p><figure class="kg-card kg-image-card"><img src="https://pbs.twimg.com/media/GE9HAQ2WQAE6xAG?format=jpg&amp;name=large" class="kg-image" alt="Image" loading="lazy" width="1425" height="1040"></figure><figure class="kg-card kg-image-card"><img src="https://pbs.twimg.com/media/GE9HARAWUAAXuUI?format=jpg&amp;name=large" class="kg-image" alt="Image" loading="lazy" width="1532" height="1036"></figure><p>The proposed framework achieves both higher accuracy and greater explainability. In future work, the authors plan to not only use more advanced deep learning models for improved accuracy but to also develop a process-oriented feature selection approach.</p><p>I especially like the explainability of the approach,which is key to eventual acceptance of the PPM (or any other) technology. And I agree with the authors that predictive models in context of business processes require additional process-specific features. So go read the paper!</p>]]></content:encoded></item><item><title><![CDATA[[PotW] Multi-instance data behavior in BPMN]]></title><description><![CDATA[Paper of the week: "Multi-instance data behavior in BPMN"]]></description><link>https://blog.vidgof.eu/paper-of-the-week-2023-11-19/</link><guid isPermaLink="false">65b7f4f267f617b91ebbc3bb</guid><category><![CDATA[Paper of the week]]></category><category><![CDATA[Academic]]></category><dc:creator><![CDATA[Maxim Vidgof]]></dc:creator><pubDate>Sun, 19 Nov 2023 20:24:00 GMT</pubDate><content:encoded><![CDATA[<p>Paper of the week: &quot;Multi-instance data behavior in BPMN&quot; by Maximilian K&#xF6;nig &amp; Mathias Weske. Check it out at: <a href="https://ceur-ws.org/Vol-3618/forum_paper_4.pdf?ref=blog.vidgof.eu">https://ceur-ws.org/Vol-3618/forum_paper_4.pdf</a></p><p>BPMN is well known for its poor support for data flow.Despite attempts to improve it,some important aspects are still left out.The authors especially highlight issues when single process instance has to deal with multiple instances of data objects,especially at different states.</p><p>To this end, the authors propose semantics for multi-instance data objects and data object collections (DOC) and their translation to colored Petri nets. Authors define 4 operations for DOCs:<br>- State transitions <br>- Splitting<br>&#x2043; Merging<br>&#x2043; Creation</p><p>For instance, splitting a DOC into 2 collections of the same data objects in different states can be realized as shown below.<br>(See helpful explanations and the running example in the paper)</p><figure class="kg-card kg-image-card"><img src="https://pbs.twimg.com/media/F_UtEcfWUAAmAPW?format=jpg&amp;name=large" class="kg-image" alt="Image" loading="lazy" width="1772" height="925"></figure><p>The authors see this work as starting point for future research on multi-instance behavior in process data flow. Further steps include more complex constructs,data locking mechanisms and derivation of BPMN modeling guidelines from the newly defined behavior. So go read the paper!</p><p>Personally,I have seen a lot of attempts to improve data flow support in BPMN,some of them even independently proposed by different authors.Still,they are not widely agreed upon neither adopted by major tools.Should we work towards BPMN 2.1 or 3.0?</p>]]></content:encoded></item><item><title><![CDATA[[HL] Abstractions, Scenarios, and Prompt Definitions for Process Mining with LLMs: A Case Study]]></title><description><![CDATA[Abstractions, Scenarios, and Prompt Definitions for Process Mining with LLMs: A Case Study]]></description><link>https://blog.vidgof.eu/highlight-2023-09-11/</link><guid isPermaLink="false">65c50e3367f617b91ebbc408</guid><category><![CDATA[Highlight]]></category><category><![CDATA[Academic]]></category><dc:creator><![CDATA[Maxim Vidgof]]></dc:creator><pubDate>Mon, 11 Sep 2023 20:58:00 GMT</pubDate><content:encoded><![CDATA[<p>My personal highlight of the day at <a href="https://bpm2023.sites.uu.nl/?ref=blog.vidgof.eu" rel="noreferrer">BPM 2023</a>: &quot;Abstractions, Scenarios, and Prompt Definitions for Process Mining with LLMs: A Case Study&quot; by Alessandro Berti, Daniel Schuster &amp; Wil van der Aalst. Go read it at <a href="https://arxiv.org/pdf/2307.02194.pdf?ref=blog.vidgof.eu">https://arxiv.org/pdf/2307.02194.pdf</a></p><p>Their paper presents different event log abstractions enabling LLM-aided business process analytics.<br>This approach yields inspirng results, especially for descriptive questions (see pic).<br>They also integrated it in PM4Py, so we all can benefit from their work already today!</p><figure class="kg-card kg-image-card"><img src="https://pbs.twimg.com/media/F5xfYEBWUAA815f?format=jpg&amp;name=large" class="kg-image" alt="Image" loading="lazy" width="2020" height="746"></figure>]]></content:encoded></item></channel></rss>