所属单位：计算机科学与技术学院/人工智能学院/软件学院
发表刊物：Jisuanji Jicheng Zhizao Xitong
摘要：For large-scale complex organizations, it is a key problem in business process management that how to quickly find the appropriate process model what the user needs in the model repositories. Aiming at this problem, a process retrieval method based on performance constraints was proposed. In this method, the business process was transformed into the Breadth First Topology Sequence (BFTS) and the similarity values of the process modeles was calculated, thus s the candidate set was determined to reduce the retrieval space. The three performances of running time, cost and human resources of the candidate business process were calculated, and the optimal process model was selected. Comparative experiments verified that BFTS's operation efficiency and retrieval accuracy were higher than traditional greedy algorithm. © 2019, Editorial Department of CIMS. All right reserved.
ISSN号：1006-5911
是否译文：否
发表时间：2019-04-01
合写作者：Xie, Na,谢乃明,Zhao, Lu,陆森召,Sun, Yong,孙永荣,Huang, Li,刘闯
通讯作者：谭文安
发表时间：2019-04-01