Using a glow graph to represent data flow and dependency in event logs


Autoria(s): Aldahami, Abdulelah; Li, Yuefeng; Chan, Taizan
Data(s)

06/12/2015

Resumo

The idea of extracting knowledge in process mining is a descendant of data mining. Both mining disciplines emphasise data flow and relations among elements 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 the effectiveness of knowledge representation can be extended in both disciplines. To this end, we introduce a new representation of the data flow and dependency formulation using a flow graph. The flow graph 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 representations.

Identificador

http://eprints.qut.edu.au/94177/

Publicador

IEEE

Relação

DOI:10.1109/WI-IAT.2015.213

Aldahami, Abdulelah, Li, Yuefeng, & Chan, Taizan (2015) Using a glow graph to represent data flow and dependency in event logs. In International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT 2015), 6-9 December 2015, Singapore.

http://purl.org/au-research/grants/ARC/DP140103157

Direitos

Copyright 2015 IEEE

Fonte

School of Electrical Engineering & Computer Science; Faculty of Science and Technology; School of Information Systems

Palavras-Chave #080000 INFORMATION AND COMPUTING SCIENCES #data flow graphs;data mining;knowledge representation;Teleclaim process;data flow relation;data flow representation;data mining;dependency formulation;event logs;flow graph;knowledge extraction;knowledge representation;many-to-one relations;one-to-many re
Tipo

Conference Paper