Hanga Khadijah Muzzammil, Kovalchuk Yevgeniya, Gaber Mohamed Medhat
School of Computing and Digital Technology, Birmingham City University, Birmingham B4 7XG, UK.
Department of Computer Science, University of Reading, Reading RG6 6DH, UK.
Entropy (Basel). 2022 Jun 30;24(7):910. doi: 10.3390/e24070910.
This paper presents a set of methods, jointly called PGraphD*, which includes two new methods (PGraphDD-QM and PGraphDD-SS) for drift detection and one new method (PGraphDL) for drift localisation in business processes. The methods are based on deep learning and graphs, with PGraphDD-QM and PGraphDD-SS employing a quality metric and a similarity score for detecting drifts, respectively. According to experimental results, PGraphDD-SS outperforms PGraphDD-QM in drift detection, achieving an accuracy score of 100% over the majority of synthetic logs and an accuracy score of 80% over a complex real-life log. Furthermore, PGraphDD-SS detects drifts with delays that are 59% shorter on average compared to the best performing state-of-the-art method.
本文提出了一组统称为PGraphD*的方法,其中包括两种用于漂移检测的新方法(PGraphDD-QM和PGraphDD-SS)以及一种用于业务流程中漂移定位的新方法(PGraphDL)。这些方法基于深度学习和图,PGraphDD-QM和PGraphDD-SS分别采用质量度量和相似度分数来检测漂移。根据实验结果,PGraphDD-SS在漂移检测方面优于PGraphDD-QM,在大多数合成日志上实现了100%的准确率,在复杂的实际日志上实现了80%的准确率。此外,与性能最佳的现有方法相比,PGraphDD-SS检测漂移的延迟平均缩短了59%。