Breadth First Search Sequence based Method for Efficient Process Retrieval

Authors

Ye Yanming, College of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China\\ College of Information Engineering, Hangzhou Dianzi University, Hangzhou 310018, ChinaFollow
Yin Yuyu
Yin Yuyu
Xu Yueshen
Yin Jianwei

Author Country (or Countries)

China

Abstract

With increasing improvement of the business process management (BPM) technology, large-scale business process repositories have been adapted widely. However, due to the explosion of the number of business processes, a large part of enterprises are confronting with the challenge on effective management of those massive processes. Usually, each business process is modeled as a process graph, and therefore most existing approaches are based on graph mining algorithms. This paper puts forward a new method, which first utilizes the breadth first search (BFS) algorithm to label the process model, and then calculates the similarity based on the matching distance. The experimental results show that our method is efficient enough for practical use, especially suitable for fuzzy retrieval.

Suggested Reviewers

N/A

Digital Object Identifier (DOI)

http://dx.doi.org/10.12785/amis/080649

Recommended Citation

Yanming, Ye; Yuyu, Yin; Yuyu, Yin; Yueshen, Xu; and Jianwei, Yin (2014) "Breadth First Search Sequence based Method for Efficient Process Retrieval," Applied Mathematics & Information Sciences: Vol. 08: Iss. 6, Article 49.
DOI: http://dx.doi.org/10.12785/amis/080649
Available at: https://digitalcommons.aaru.edu.jo/amis/vol08/iss6/49