IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v63y2025i10p3684-3708.html
   My bibliography  Save this article

Process mining with event attributes and transition features for care pathway modelling

Author

Listed:
  • Omar Rifki
  • Zhihao Peng
  • Lionel Perrier
  • Xiaolan Xie

Abstract

This paper proposes a formal optimisation framework and algorithms for data-aware process mining with event duplication that relaxes the usual one-event-label-one-process-model-node restriction. We put forward a hierarchical representation of the event attribute values and event labelling to achieve the best balance of the complexity and precision of the process model. We posit a new quality measure, relevance, which measures how well and how precisely a process model matches a given event log. The process model optimisation consists of determining (i) the process model with labels and attribute values for each node and transition functions for each arc and (ii) the event game stipulating how each trace of the event log is played in the process model. This article also proposes a dynamic programming algorithm for optimising event games, an exact method for optimal setting of node attributes and arc transition functions, and heuristic algorithms for process model optimisation. Numerical results show the efficiency of the algorithms with respect to relevant benchmarks and an 18% improvement in the model relevance. Applications on sarcoma care pathways reveal their dependency on attributes such as surgery quality and tumour size. Our approach clearly shows how both care event repetition and data impact sarcoma care pathways whereas other data-aware miners fail.

Suggested Citation

  • Omar Rifki & Zhihao Peng & Lionel Perrier & Xiaolan Xie, 2025. "Process mining with event attributes and transition features for care pathway modelling," International Journal of Production Research, Taylor & Francis Journals, vol. 63(10), pages 3684-3708, May.
  • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:10:p:3684-3708
    DOI: 10.1080/00207543.2024.2427888
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2024.2427888
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2024.2427888?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tprsxx:v:63:y:2025:i:10:p:3684-3708. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.