摘要
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.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 377-380 |
| 页数 | 4 |
| 期刊 | Proceedings of the International Conference on Software Engineering and Knowledge Engineering, SEKE |
| 卷 | 2014-January |
| 期 | January |
| 出版状态 | 已出版 - 2014 |
| 活动 | 26th International Conference on Software Engineering and Knowledge Engineering, SEKE 2014 - Vancouver, 加拿大 期限: 1 7月 2014 → 3 7月 2014 |
学术指纹
探究 'An improved structure-based approach to measure similarity of business process models' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver