Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Detecting Implicit Dependencies Between Tasks from Event Logs
verfasst von : Lijie Wen, Jianmin Wang, Jiaguang Sun
Erschienen in: Frontiers of WWW Research and Development - APWeb 2006
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Process mining aims at extracting information from event logs to capture the business process as it is being executed. In spite of many researchers’ persistent efforts, there are still some challenging problems to be solved. In this paper, we focus on mining non-free-choice constructs, where the process models are represented in Petri nets. In fact, there are totally two kinds of causal dependencies between tasks, i.e., explicit and implicit ones. Implicit dependency is very hard to mine by current mining approaches. Thus we propose three theorems to detect implicit dependency between tasks and give their proofs. The experimental results show that our approach is powerful enough to mine process models with non-free-choice constructs.