Logo der Universität Wien

Mining and Querying Process Change Information based on Change Trees


Analyzing process change logs provides valuable information about the evolution of process instances. This information can be used to support responsible users in planning and executing future changes. Change mining results in a change process, which represents the dependencies between process changes mined from the change log. However, when it comes to highly adaptive process settings, multiple limitations of the change process representation can be found, i.e., based on change processes it is not possible to provide answers to important analysis questions such as `How many instances have evolved in a similar way?' or `Which changes have occurred following a particular change?'. In this paper, change trees and n-gram change trees are introduced to serve as a basis to analyze changes in highly adaptive process instances. Moreover, algorithms for discovering change trees and n-gram change trees from change logs are presented. The applicability of the approach is evaluated based on a systematic comparison with change mining, a proof-of-concept implementation and by analyzing real-world data.

Grafik Top
Grafik Top
Paper in Conference Proceedings or in Workshop Proceedings (Full Paper in Proceedings)
Event Title
International Conference on Service Oriented Computing
Workflow Systems and Technology
Event Location
Goa, India
Event Type
Event Dates
Page Range
pp. 269-284
November 2015
Grafik Top
Contact us
Faculty of Computer Science
University of Vienna

Währinger Straße 29
A-1090 Vienna