Abstract: The idea of extracting knowledge from log data for both data mining and process mining emphasises data flow and relations among data items in the data. Unfortunately, challenges have been encountered when working with the data flow and relations. One of the challenges is that the representation of the data flow between a pair of elements or tasks is insufficiently simplified and formulated, as it considers only a one-to-one data flow relation. In this paper, we discuss how to effectively represent dependency relations in log data. To this end, we introduce a new representation of the data flow and dependency formulation using an extracted flow graph. The solution solves the issue of the insufficiency of presenting other relation types, such as many-to-one and one-to-many relations. As an experiment, a new evaluation framework is applied to the Teleclaim process in order to show how this method can provide us with more precise results when compared with other definitions.
Keywords: Data mining, process mining, flow graph, data flow, dependency
