Discovery of temporal patterns from process instances

San Yih Hwang; Chih Ping Wei; Wan Shiou Yang

doi:10.1016/j.compind.2003.10.006

Discovery of temporal patterns from process instances

San Yih Hwang, Chih Ping Wei, Wan Shiou Yang

Department of Information Management

Research output: Contribution to journal › Article

38 Citations (Scopus)

Abstract

Existing work in process mining focuses on the discovery of the underlying process model from their instances. In this paper, we do not assume the existence of a single process model to which all process instances comply, and the goal is to discover a set of frequently occurring temporal patterns. Discovery of temporal patterns can be applied to various application domains to support crucial business decision-making. In this study, we formally defined the temporal pattern discovery problem, and developed and evaluated three different temporal pattern discovery algorithms, namely TP-Graph, TP-Itemset and TP-Sequence. Their relative performances are reported.

Original language	English
Pages (from-to)	345-364
Number of pages	20
Journal	Computers in Industry
Volume	53
Issue number	3
DOIs	https://doi.org/10.1016/j.compind.2003.10.006
Publication status	Published - 2004 Apr 1

Fingerprint

All Science Journal Classification (ASJC) codes

Computer Science(all)
Engineering(all)

Cite this

Hwang, S. Y., Wei, C. P., & Yang, W. S. (2004). Discovery of temporal patterns from process instances. Computers in Industry, 53(3), 345-364. https://doi.org/10.1016/j.compind.2003.10.006

@article{f125cb8165834489b0c32e69310f89ab,

title = "Discovery of temporal patterns from process instances",

abstract = "Existing work in process mining focuses on the discovery of the underlying process model from their instances. In this paper, we do not assume the existence of a single process model to which all process instances comply, and the goal is to discover a set of frequently occurring temporal patterns. Discovery of temporal patterns can be applied to various application domains to support crucial business decision-making. In this study, we formally defined the temporal pattern discovery problem, and developed and evaluated three different temporal pattern discovery algorithms, namely TP-Graph, TP-Itemset and TP-Sequence. Their relative performances are reported.",

author = "Hwang, {San Yih} and Wei, {Chih Ping} and Yang, {Wan Shiou}",

year = "2004",

month = apr

day = "1",

doi = "10.1016/j.compind.2003.10.006",

language = "English",

volume = "53",

pages = "345--364",

journal = "Computers in Industry",

issn = "0166-3615",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Discovery of temporal patterns from process instances

AU - Hwang, San Yih

AU - Wei, Chih Ping

AU - Yang, Wan Shiou

PY - 2004/4/1

Y1 - 2004/4/1

N2 - Existing work in process mining focuses on the discovery of the underlying process model from their instances. In this paper, we do not assume the existence of a single process model to which all process instances comply, and the goal is to discover a set of frequently occurring temporal patterns. Discovery of temporal patterns can be applied to various application domains to support crucial business decision-making. In this study, we formally defined the temporal pattern discovery problem, and developed and evaluated three different temporal pattern discovery algorithms, namely TP-Graph, TP-Itemset and TP-Sequence. Their relative performances are reported.

AB - Existing work in process mining focuses on the discovery of the underlying process model from their instances. In this paper, we do not assume the existence of a single process model to which all process instances comply, and the goal is to discover a set of frequently occurring temporal patterns. Discovery of temporal patterns can be applied to various application domains to support crucial business decision-making. In this study, we formally defined the temporal pattern discovery problem, and developed and evaluated three different temporal pattern discovery algorithms, namely TP-Graph, TP-Itemset and TP-Sequence. Their relative performances are reported.

UR - http://www.scopus.com/inward/record.url?scp=0347600602&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0347600602&partnerID=8YFLogxK

U2 - 10.1016/j.compind.2003.10.006

DO - 10.1016/j.compind.2003.10.006

M3 - Article

AN - SCOPUS:0347600602

VL - 53

SP - 345

EP - 364

JO - Computers in Industry

JF - Computers in Industry

SN - 0166-3615

IS - 3

ER -

Access to Document

10.1016/j.compind.2003.10.006