Time and activity sequence prediction of business process instances

被引:91
作者
Polato, Mirko [1 ]
Sperduti, Alessandro [1 ]
Burattin, Andrea [2 ]
de Leoni, Massimiliano [3 ]
机构
[1] Univ Padua, Torre Archimede,Via Trieste 63, I-35121 Padua, Italy
[2] Tech Univ Denmark, DTU, Lyngby, Denmark
[3] Eindhoven Univ Technol, Eindhoven, Netherlands
关键词
Process mining; Prediction; Remaining time; Machine learning;
D O I
10.1007/s00607-018-0593-x
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The ability to know in advance the trend of running process instances, with respect to different features, such as the expected completion time, would allow business managers to timely counteract to undesired situations, in order to prevent losses. Therefore, the ability to accurately predict future features of running business process instances would be a very helpful aid when managing processes, especially under service level agreement constraints. However, making such accurate forecasts is not easy: many factors may influence the predicted features. Many approaches have been proposed to cope with this problem but, generally, they assume that the underlying process is stationary. However, in real cases this assumption is not always true. In this work we present new methods for predicting the remaining time of running cases. In particular we propose a method, assuming process stationarity, which achieves state-of-the-art performances and two other methods which are able to make predictions even with non-stationary processes. We also describe an approach able to predict the full sequence of activities that a running case is going to take. All these methods are extensively evaluated on different real case studies.
引用
收藏
页码:1005 / 1031
页数:27
相关论文
共 35 条
[1]  
[Anonymous], 2009, SIGKDD Explorations, DOI DOI 10.1145/1656274.1656278
[2]  
[Anonymous], PROCESS PREDICTION N
[3]  
[Anonymous], 2008, SOFTWARE SYSTEMS MOD
[4]  
[Anonymous], IEEE T SERVICES COMP
[5]  
[Anonymous], QUEUEING METHODS SER
[6]  
[Anonymous], CAISE
[7]  
[Anonymous], 2008, Introduction to information retrieval
[8]  
[Anonymous], IJCNN WCCI
[9]  
[Anonymous], MARKOV PREDICTION MO
[10]  
[Anonymous], DEEP LEARNING APPROA