|
ABSTRACT
In the past few years there has been an increasing interest in the analysis of process logs. Several proposed techniques, such as workflow mining, are aimed at automatically deriving the underlying workflow models. However, current approaches only pay little attention on an important piece of information contained in process logs: the timestamps, which are used to define a sequential ordering of the performed tasks. In this work we try to overcome these limitations by explicitly including time in the extracted knowledge, thus making the temporal information a first-class citizen of the analysis process. This makes it possible to discern between apparently identical process executions that are performed with different transition times between consecutive tasks. This paper proposes a framework for the user-interactive exploration of a condensed representation of groups of executions of a given process. The framework is based on the use of an existing mining paradigm: Temporally-Annotated Sequences (TAS). These are aimed at extracting sequential patterns where each transition between two events is annotated with a typical transition time that emerges from input data. With the extracted TAS, which represent sets of possible frequent executions with their typical transition times, a few factorizing operators are built. These operators condense such executions according to possible parallel or possible mutual exclusive executions. Lastly, such condensed representation is rendered to the user via the exploration graph, namely the Temporally-Annotated Graph (TAG). The user, the domain expert, is allowed to explore the different and alternative factorizations corresponding to different interpretations of the actual executions. According to the user choices, the system discards or retains certain hypotheses on actual executions and shows the consequent scenarios resulting from the coresponding re-aggregation of the actual data.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
The think3 company. http://www.think3.com.
|
| |
2
|
Rakesh Agrawal, Dimitrios Gunopulos, and Frank Leymann. Mining process models from workflow logs. volume 1377--469+ of LNCS, '98.
|
| |
3
|
|
| |
4
|
|
| |
5
|
|
| |
6
|
|
| |
7
|
Fosca Giannotti, Mirco Nanni, and Dino Pedreschi. Efficient mining of temporally annotated sequences. In Proc. of the 6th SIAM Intern. Conf. on Data Min., 2006.
|
| |
8
|
Fosca Giannotti, Mirco Nanni, Dino Pedreschi, and Fabio Pinelli. Trajectory patter mining. In The 30th KDD Int.Conf. on Knowl.Disc. and Data Min., '07.
|
 |
9
|
|
| |
10
|
|
| |
11
|
|
| |
12
|
|
| |
13
|
|
| |
14
|
Steffen Kempe and Jochen Hipp. Mining sequences of temporal intervals. In PKDD, pages 569--576, 2006.
|
| |
15
|
|
| |
16
|
|
 |
17
|
|
| |
18
|
|
 |
19
|
|
| |
20
|
|
| |
21
|
S.Jablonski and C.Bussler. Workflow Management: Modeling Concepts, Architecture and Implementation. Intern. Thomson Comp. Press, 1996.
|
| |
22
|
W. M. P. van der Aalst , B. F. van Dongen , J. Herbst , L. Maruster , G. Schimm , A. J. M. M. Weijters, Workflow mining: a survey of issues and approaches, Data & Knowledge Engineering, v.47 n.2, p.237-267, November 2003
[doi> 10.1016/S0169-023X(03)00066-1]
|
| |
23
|
Wil M. P. van der Aalst, Jorg Desel, and Andreas Oberweis, editors. Business Process Management, Models, Techniques, and Empirical Studies, volume 1806 of LNCS. Springer, 2000.
|
| |
24
|
|
| |
25
|
T. Weijters and W. M. P. van der Aalst. Process mining: Discovering workflow models from event-based data., 2001.
|
| |
26
|
Edi Winarko and John F. Roddick. Discovering richer temporal association rules from interval-based data. In A. Min Tjoa and J. Trujillo, editors, 7th DaWaK, volume 3589 of LNCS, pages 315--325. Springer, '05.
|
|