Journal
ENTERPRISE INFORMATION SYSTEMS
Volume 14, Issue 1, Pages 83-109Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/17517575.2019.1694179
Keywords
A* algorithm; Inter-enterprise collaboration; Business process; Breadth-first traversal; Service retrieval
Categories
Funding
- National Natural Science Foundation of China [61672022]
- Key Disciplines of Computer Science and Technology of Shanghai Polytechnic University [XXKZD1604]
Ask authors/readers for more resources
Due to the increasing of complex services in the deployed cloud platforms, business process retrieval has become a challenge for enterprises. However, traditional methods mostly focus on single attribute of business processes, rather than considering the attribute relationship and the loop structure. In this paper, we propose a breadth-first traversal (BFT) similarity calculation approach to overcome these drawbacks. First, we transform business process models into breadth-first traversal sequences (BFTS) using breadth-first traversal. Next, the BFTSs are divided into behavior sequences and structure sequences. Finally, the similarity values are calculated by weighting the two parts. The experimental results demonstrate our proposed method is accurate and time-saving in searching business processes.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available