Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
A graph distance metric based on the maximal common subgraph
Pattern Recognition Letters
Software process validation: quantitatively measuring the correspondence of a process to a model
ACM Transactions on Software Engineering and Methodology (TOSEM)
Elicitation of Knowledge from Multiple Experts Using Network Inference
IEEE Transactions on Knowledge and Data Engineering
Distributed and Parallel Databases
Workflow mining: a survey of issues and approaches
Data & Knowledge Engineering
Automatic Control of Workflow Processes Using ECA Rules
IEEE Transactions on Knowledge and Data Engineering
Workflow Mining: Discovering Process Models from Event Logs
IEEE Transactions on Knowledge and Data Engineering
Efficient Phrase-Based Document Indexing for Web Document Clustering
IEEE Transactions on Knowledge and Data Engineering
Similarity evaluation on tree-structured data
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
A theory of enterprise transformation
Systems Engineering
Workflow management for enterprise transformation
Information-Knowledge-Systems Management - Work, Workflow, Information Systems and Enterprise Transformation
Analysis and Reuse of Plots Using Similarity and Analogy
ER '08 Proceedings of the 27th International Conference on Conceptual Modeling
Experimenting statecharts for multiple experts knowledge elicitation in agriculture
Expert Systems with Applications: An International Journal
Similarity metrics for surgical process models
Artificial Intelligence in Medicine
A comparative survey of business process similarity measures
Computers in Industry
Mining usage patterns from a repository of scientific workflows
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Detection and resolution of conflicting change operations in version management of process models
Software and Systems Modeling (SoSyM)
| Hi-index | 0.00 |
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.