DocumentCode
1611624
Title
Heuristic Recovery of Missing Events in Process Logs
Author
Wei Song ; Xiaoxu Xia ; Jacobsen, Hans-Arno ; Pengcheng Zhang ; Hao Hu
Author_Institution
Sch. of Comput. Sci. & Eng., Nanjing Univ. of Sci. & Technol., Nanjing, China
fYear
2015
Firstpage
105
Lastpage
112
Abstract
Event logs are of paramount significance for process mining and complex event processing. Yet, the quality of event logs remains a serious problem. Missing events of logs are usually caused by omitting manual recording, system failures, and hybrid storage of executions of different processes. It has been proved that the problem of minimum recovery based on a priori process specification is NP-hard. State-of-the-art approach is still lacking in efficiency because of the large search space. To address this issue, in this paper, we leverage the technique of process decomposition and present heuristics to efficiently prune the unqualified sub-processes that fail to generate the minimum recovery. We employ real-world processes and their incomplete sequences to evaluate our heuristic approach. The experimental results demonstrate that our approach achieves high accuracy as the state-of-the-art approach does, but it is more efficient.
Keywords
business data processing; computational complexity; NP-hard; complex event processing; event logs; heuristic missing events recovery; process decomposition; process logs; process specification; Business; Data mining; Firing; Manuals; Petri nets; Runtime; Time complexity; Petri nets; heuristic recovery; missing events; process decomposition; trace replaying;
fLanguage
English
Publisher
ieee
Conference_Titel
Web Services (ICWS), 2015 IEEE International Conference on
Conference_Location
New York, NY
Print_ISBN
978-1-4673-7271-8
Type
conf
DOI
10.1109/ICWS.2015.24
Filename
7195558
Link To Document