Efficient recovery of missing events

Abstract

For various entering and transmission issues raised by human or system, missing events often occur in event data, which record execution logs of business processes. Without recovering these missing events, applications such as provenance analysis or complex event processing built upon event data are not reliable. Following the minimum change discipline in improving data quality, it is also rational to find a recovery that minimally differs from the original data. Existing recovery approaches fall short of efficiency owing to enumerating and searching over all the possible sequences of events. In this paper, we study the efficient techniques for recovering missing events. According to our theoretical results, the recovery problem is proved to be NP-hard. Nevertheless, we are able to concisely represent the space of event sequences in a branching framework. Advanced indexing and pruning techniques are developed to further improve the recovery efficiency. Our proposed efficient techniques make it possible to find top-k recoveries. The experimental results demonstrate that our minimum recovery approach achieves high accuracy, and significantly outperforms the state-of-the-art technique for up to 5 orders of magnitudes improvement in time performance.

Efficient Path Routing Over Road Networks in the Presence of Ad-Hoc Obstacles

“…When queue Q is empty, it indicates that we cannot find candidate paths, and thus return an empty query answer set ∅ (lines [19][20]. Otherwise, we will prepare for expanding the length of candidate paths in Q (lines [21][22][23][24][25][26][27][28] Candidate Path Refinement: After the index traversal and path expansion, we can obtain a number of candidate paths in set S cand . Then, we can refine these paths by checking constraints of keywords, weather, and traveling times, and return actual PRAO answers (line 41).…”

Petri net‐based deviation detection between a process model with loop semantics and event logs

“…(See the works of Wang et al 28,29 ) A transition firing sequence in a process model N S = (PN, α, m i , m f ) is defined recursively as follows:…”

Repairing vertex labels under neighborhood constraints

“…WFNT is a set of 490 workflow networks collected from a train manufacturer [28], each of which corresponds to a workflow execution with 4-45 activities (vertexes). All these workflow executions compose the instance graph.…”