1993
DOI: 10.1007/978-3-642-78486-6_32
|View full text |Cite
|
Sign up to set email alerts
|

Office Automation Systems that are “Programmed” by their Users

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

1994
1994
2015
2015

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 4 publications
0
6
0
Order By: Relevance
“…The main areas of interest concerned how to learn the structure of the graph that represents the process model. As mentioned previously, early approaches were based on traditional graph models such as FSMs [Cook and Wolf 1996;Bocionek and Mitchell 1993] or HMMs [Herbst 2000a], which are unable to model concurrency [Herbst and Karagiannis 1998;Herbst 2000b] and hence are useless in many real cases. Techniques able to handle more complex cases followed in subsequent years.…”
Section: Related Workmentioning
confidence: 99%
“…The main areas of interest concerned how to learn the structure of the graph that represents the process model. As mentioned previously, early approaches were based on traditional graph models such as FSMs [Cook and Wolf 1996;Bocionek and Mitchell 1993] or HMMs [Herbst 2000a], which are unable to model concurrency [Herbst and Karagiannis 1998;Herbst 2000b] and hence are useless in many real cases. Techniques able to handle more complex cases followed in subsequent years.…”
Section: Related Workmentioning
confidence: 99%
“…A partially related topic, faced in [6], is learning software agents that provide assistance in managing work-related activities, called software secretaries, by a dialog-based interaction with a skilled user that explains the tasks he is performing. This is mapped onto the task of learning from scratch a FSM representing the net of negotiations between agents.…”
Section: Miningmentioning
confidence: 99%
“…It uses a technique called dialog-based learning to acquire a workflow model represented as a finite state machine by observing the transfer of structured e-mails. RAP has some limitations concerning inconsistent user behavior (see [2]), which are not present in our approach.…”
Section: Related Workmentioning
confidence: 95%
“…Given a sequence of observations e = e 1 e 2 : : : e l with e i 2 V and an initial HMM 0 = Q; V; A 0 ; B 0 ; 0 the Baum-Welch algorithm iteratively re-estimates the parameters A i ; B i and i until some limiting point is reached. 2 The formulas for the reestimation of the parameters are given for example in [11]. It was proven that this procedure converges to a local maximum of the likelihood function P ej .…”
Section: Hidden Markov Modelsmentioning
confidence: 99%
See 1 more Smart Citation