Titlebook: Business Process Management Workshops; BPM 2017 Internation Ernest Teniente,Matthias Weidlich Conference proceedings 2018 Springer Internat

和平主義

繞著哥哥問(wèn)

978-3-319-74029-4Springer International Publishing AG 2018

CHAR

NOT

原始

Structural Feature Selection for Event Logside machine learning based techniques with quick response times for interactive computer assisted root cause analysis. In particular, we create structural features from process mining such as activity and transition occurrence counts, and ordering of activities to be evaluated as potential features

尊敬

Towards Intelligent Process Support for Customer Service Desks: Extracting Problem Descriptions fromity of products, the increasing complexity of knowledge that service employees need to deal with, and steady cost pressure. Artificial intelligence (AI) can support service processes in a variety of ways, however, many projects simply propose replacing employees with chat bots. In contrast to pure a

隱語(yǔ)

惡名聲

Objective Coordination with Business Artifacts and Social Engagementsns of coordination in their own right, despite the fact that they have the potential of being natural means of coordination in their own right. Coordination issues are transfered (e.g. by BALSA) to solutions that are already available in the literature on choreography and choreography languages. Ins

緊張過(guò)度

Enhancing Workflow-Nets with Data for Trace Completionues and tools which support more complex forms of process analysis. Many of them, such as conformance checking, process alignment, mining and enhancement, rely on . observation of past (tracked and logged) executions. In many real cases, however, the lack of human or IT-support on all the steps of p

EXULT

Optimal Paths in Business Processes: Framework and Applicationsume that information about the utility associated with the execution of activities in a process is available. Using the workflow hypergraph abstraction, finding a utility maximising path in a process becomes a generalised shortest hyperpath problem, which is NP-hard. We propose a solution that uses