检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:侯晨煜 曹斌[1] 王佳星[1] 范菁[1] HOU Chenyu, CAO Bin, WANG Jiaxing, FAN Jing(Computer Science and Technology College, Zhejiang University of Technology, Hangzhou 310023, Chin)
机构地区:[1]浙江工业大学计算机科学与技术学院,浙江杭州310023
出 处:《计算机集成制造系统》2018年第7期1766-1773,共8页Computer Integrated Manufacturing Systems
基 金:国家自然科学基金资助项目(61602411;61572437);浙江省重大科技专项资助项目(2015C01034;2015C01029)~~
摘 要:为了解决流程差别检测问题,提出一种基于圈复杂度和独立路径的流程差别检测算法。算法利用圈复杂度衡量流程的复杂度,并计算流程的独立路径。一个流程的独立路径数量与圈复杂度相等。然后通过KM算法将两个流程之间的独立路径进行最优匹配,使匹配后的独立路径的相似度最大,两个流程之间的独立路径的编辑操作即为流程之间的差别。通过大量实验证明了算法在有效性上能达到实际使用要求,并且能够在1s内完成流程差别检测。To solve the detecting difference in business process management, a process differential detection algorithm based on circle complexity and independent path was proposed, which measured the process complexity by circle complexity and calculated the independent paths of the process. The number of independent paths for a process model was equal to circle complexity. To maximize the similarity of independent paths between two process models, KM algorithm was utilized to match independent paths optimally. Eventually, the edition operation sequence of independent paths between two process models was the difference between two process models. Extensive experiments were carried out to prove that the algorithm could achieve the practical requirement in terms of accuracy and detect differences within 1 second.
分 类 号:TP3[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.191.120.131