Development of Distance Measures for Process Mining, Discovery and Integration

Development of Distance Measures for Process Mining, Discovery and Integration

Joonsoo Bae (Chonbuk National University, South Korea), Ling Liu (Georgia Institute of Technology, USA), James Caverlee (Georgia Institute of Technology, USA), Liang-Jie Zhang (IBM T.J. Watson Research Center, USA) and Hyerim Bae (Pusan National University, South Korea)
Copyright: © 2007 |Pages: 17
DOI: 10.4018/jwsr.2007100101
OnDemand PDF Download:
No Current Special Offers


Business processes continue to play an important role in today’s service-oriented enterprise computing systems. Mining, discovering, and integrating process-oriented services has attracted growing attention in the recent years. In this article, we present a quantitative approach to modeling and capturing the similarity and dissimilarity between different process designs. We derive the similarity measures by analyzing the process dependency graphs of the participating workflow processes. We first convert each process dependency graph into a normalized process matrix. Then we calculate the metric space distance between the normalized matrices. This distance measure can be used as a quantitative and qualitative tool in process mining, process merging, and process clustering, and ultimately it can reduce or minimize the costs involved in design, analysis, and evolution of workflow systems.

Complete Article List

Search this Journal:
Open Access Articles
Volume 19: 4 Issues (2022): Forthcoming, Available for Pre-Order
Volume 18: 4 Issues (2021): 2 Released, 2 Forthcoming
Volume 17: 4 Issues (2020)
Volume 16: 4 Issues (2019)
Volume 15: 4 Issues (2018)
Volume 14: 4 Issues (2017)
Volume 13: 4 Issues (2016)
Volume 12: 4 Issues (2015)
Volume 11: 4 Issues (2014)
Volume 10: 4 Issues (2013)
Volume 9: 4 Issues (2012)
Volume 8: 4 Issues (2011)
Volume 7: 4 Issues (2010)
Volume 6: 4 Issues (2009)
Volume 5: 4 Issues (2008)
Volume 4: 4 Issues (2007)
Volume 3: 4 Issues (2006)
Volume 2: 4 Issues (2005)
Volume 1: 4 Issues (2004)
View Complete Journal Contents Listing