Process Mining, Discovery, and Integration using Distance Measures

  • Authors:
  • Joonsoo Bae;Ling Liu;James Caverlee;William B. Rouse

  • Affiliations:
  • Chonbuk National Univ., South Korea;Georgia Institute of Technology, USA;Georgia Institute of Technology, USA;Georgia Institute of Technology, USA

  • Venue:
  • ICWS '06 Proceedings of the IEEE International Conference on Web Services
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Business processes continue to play an important role in today's service-oriented enterprise computing systems. Mining, discovering, and integrating processoriented services has attracted growing attention in the recent year. In this paper 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.