2011
DOI: 10.1007/978-3-642-20511-8_59
|View full text |Cite
|
Sign up to set email alerts
|

Predictive Analytics for Semi-structured Case Oriented Business Processes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 16 publications
(13 citation statements)
references
References 14 publications
0
13
0
Order By: Relevance
“…Neither do the authors envision user support through recommendations. Additionally, [11] aims at detecting which document content has an effect on the process outcome, ultimately to provide user recommendations. The process itself however remains rigid and the document structure is pre-defined.…”
Section: Discussion and Related Workmentioning
confidence: 99%
“…Neither do the authors envision user support through recommendations. Additionally, [11] aims at detecting which document content has an effect on the process outcome, ultimately to provide user recommendations. The process itself however remains rigid and the document structure is pre-defined.…”
Section: Discussion and Related Workmentioning
confidence: 99%
“…This flexibility makes our work particularly applicable to detecting changes in semi-structured business processes where execution is not necessarily driven by a formal process model, and thus mining a formal process model first in order to compute process changes may not make sense. In particular, our technique could be used to determine when and the degree to which a mined adaptive representation of a semi-structured business process such as the probabilistic graph by Lakshmanan et al [3] should be updated. To the best of our knowledge, this paper represents one of the first attempts at applying concepts from spectral graph analysis to business process change detection.…”
Section: A Similarity Between Mined Process Modelsmentioning
confidence: 99%
“…In this paper we propose a technique to provide this on the basis of computing graph spectra of incoming execution traces. Such information could trigger, for instance an update to an existing mined representation of the business process such as the adaptive probabilistic graph proposed in [3] for capturing semistructured business processes. This graph requires updates each time a new execution trace arrives.…”
Section: Introductionmentioning
confidence: 99%
“…Subsequently, we determine a dependency between message types and activities dynamically through analysis of execution traces. In a similar effort, Lakshmanan et al [12] describe how an ant colony optimization algorithm learns dependencies of document contents (e.g., the impact of certain values within a message) to predict the flow and outcome of a process. They also apply exponential aging to keep the decision probabilities up to date.…”
Section: Related Workmentioning
confidence: 99%
“…For each tuple, we step through the process model in breadth-first style (lines [4][5][6][7][20][21] and locate the corresponding FlowDirection arc and FlowData annotation (lines [8][9][10][11]19). Once found, we increase the FlowData occurrence value (occ(f d, mt)) using exponentially weighted moving average (EWMA) (lines [12][13][14][15]. At the end, FlowData annotations that are not covered by sequence tuples (tup(msg, act)) receive a lower occurrence value (lines 22-23): Message types that show up for the first time, or messages types that arrive early result in a new FlowData annotation (lines [16][17][18].…”
Section: Self-learning Message Flowsmentioning
confidence: 99%