Abstract
It is common for large enterprises or organizations to maintain repositories of process models. This paper focuses on how to measure the similarity and construct matching relations more effectively between process models. To resolve exponential time complexity to match node compositions, we proposed a graph-edit distance similarity metric based on SESE process fragments, and a greedy algorithm is employed to construct the optimal matching relations. Then a method to construct matching relations of fragments based on process structure tree is proposed. Finally, a comparative experiment based on real-world process models from BPM AI repository is conducted to evaluate the effectiveness and efficiency of our approach.
| Original language | English |
|---|---|
| Pages (from-to) | 377-380 |
| Number of pages | 4 |
| Journal | Proceedings of the International Conference on Software Engineering and Knowledge Engineering, SEKE |
| Volume | 2014-January |
| Issue number | January |
| State | Published - 2014 |
| Event | 26th International Conference on Software Engineering and Knowledge Engineering, SEKE 2014 - Vancouver, Canada Duration: 1 Jul 2014 → 3 Jul 2014 |
Keywords
- Business process management
- Process fragment
- Process model matching
- Process similarity
Fingerprint
Dive into the research topics of 'An improved structure-based approach to measure similarity of business process models'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver