This dissertation investigates the applicability of timed automata in the domain of biological process mining. A new type of automata models the change of the variables' values without explicitly assuming the inter-dependencies. Thus, a method which automatically identifies states and transitions of the given process is established. A subsequent problem is the scalability of the approach for large data sets. Therefore, two methods that use online maximum frequent pattern based clustering are presented. Background knowledge is included in the model by attribute constrained clustering.
«
This dissertation investigates the applicability of timed automata in the domain of biological process mining. A new type of automata models the change of the variables' values without explicitly assuming the inter-dependencies. Thus, a method which automatically identifies states and transitions of the given process is established. A subsequent problem is the scalability of the approach for large data sets. Therefore, two methods that use online maximum frequent pattern based clustering are pre...
»