Abstract
Process Mining, or Process Discovery, is a method for modeling the workflow of a business process from event logs. Business process models contain sequential and parallel traces. In this paper, a modification of the frequently used process-mining algorithm Heuristics Miner is proposed. The proposed algorithm is called Modified Time-based Heuristics Miner because it considers not only the sequence of activities but also the time-based information from the event log. It can effectively distinguish parallel (AND), single choice (XOR) and conditional (OR) patterns; the latter cannot be discovered by the original Heuristics Miner. The threshold intervals are determined on the basis of the average dependency measure in the dependency graph. The experimental results show that the proposed algorithm is able to discover concurrent business processes formed by parallel (AND) and conditional (OR) patterns, whereas the existing Heuristics Miner algorithm can only discover concurrent business processes formed by parallel (AND) patterns. This paper also provides an evaluation of validity an fitness of the discovered process model.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Review on Computers and Software (IRECOS)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
