Abstract
Mining, discovering, and integrating process-oriented services has attracted growing attention in the recent years. Workflow precedence graph and workflow block structures are two important factors for comparing and mining processes based on distance similarity measure. Some existing work has done on comparing workflow designs based on their precedence graphs. However, there lacks of standard distance metrics for comparing workflows that contain complex block structures such as parallel OR, parallel AND. In this paper we present a quantitative approach to modeling and capturing the similarity and dissimilarity between different workflow designs, focusing on similarity and dissimilarity between the block structures of different workflow designs. We derive the distance-based similarity measures by analyzing the workflow block structure of the participating workflow processes in four consecutive phases. We first convert each workflow dependency graph into a block tree by using our block detection algorithm. Second, we transform the block tree into a binary tree to provide a normalized reference structure for distance based similarity analysis. Third, we construct a binary branch vector by encoding the binary tree. Finally, we calculate the distance metric between two binary branch vectors.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
van der Aalst, W.M.P., ter Hofstede, A.H.M., Kiepuszewski, B., Barros, A.P.: Workflow Patterns. Distributed and Parallel Databases 14(3), 5–51 (2003)
van der Aalst, W.M.P., van Dongen, B.F., Herbst, J., Maruster, L., Schimm, G., Weijters, A.J.M.M.: Workflow Mining: A Survey of Issues and Approaches. Data and Knowledge Engineering 47(2), 237–267 (2003)
van der Aalst, W.M.P., Weijters, A.J.M.M., Maruster, L.: Workflow Mining: Discovering Process Models from Event Logs. IEEE Transactions on Knowledge and Data Engineering 16(9), 1128–1142 (2004)
Bae, J., Caverlee, J., Liu, L., Rouse, B.: Process Mining, Discovery, and Integration using Distance Measures. Technical Report GT-CSS-2006-006 (April 2006)
Bae, J., Bae, H., Kang, S., Kim, Y.: Automatic control of workflow process using ECA rules. IEEE Trans. on Knowledge and Data Engineering 16(8), 1010–1023 (2004)
Bunke, H., Shearer, K.: A Graph Distance Metric based on the Maximal Common Subgraph. Pattern Recognition Letters 19(3-4), 255–259 (1998)
Cook, J.E., Wolf, A.L.: Software Process Validation: Quantitatively Measuring the Correspondence of a Process to a Model. ACM Transactions on Software Engineering and Methodology 8(2), 147–176 (1999)
Hammouda, K.M., Kamel, M.S.: Efficient Phrase-Based Document Indexing for Web Document Clustering. IEEE Transactions on Knowledge and Data Engineering 16(10), 1279–1296 (2004)
RosettaNet, RosettaNetStandard (RosettaNet Partner Interface Processes), http://www.rosettanet.org
Rouse, W.B.: A Theory of Enterprise Transformation. Systems Engineering 8(4) (2005)
Rush, R., Wallace, W.A.: Elicitation of knowledge from multiple experts using network inference. IEEE Transactions on Knowledge and Data Engineering 9(5), 688–698 (1997)
WfMC, Workflow Management Coalition Workflow Standard Process Definition Interface – XML Process Definition Language, Document Number WFMC-TC-1025 Version 1.13, September 7 (2005)
Yang, R., Kalnis, P., Tung, A.: Similarity Evaluation on Tree-structured Data. In: ACM SIMOD 2005, June 14-16, 2005, pp. 754–765 (2005)
Zhang, K., Shasha, D.: Simple Fast Algorithms for the Editing Distance between Trees and Related Problems. SIAM Journal of Computing 18(6), 1245–1262 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bae, J., Caverlee, J., Liu, L., Yan, H. (2006). Process Mining by Measuring Process Block Similarity. In: Eder, J., Dustdar, S. (eds) Business Process Management Workshops. BPM 2006. Lecture Notes in Computer Science, vol 4103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11837862_15
Download citation
DOI: https://doi.org/10.1007/11837862_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38444-1
Online ISBN: 978-3-540-38445-8
eBook Packages: Computer ScienceComputer Science (R0)