【24h】

Vectorial Signature for Matching Business Process Graphs

机译:用于匹配业务流程图的矢量签名

获取原文
获取原文并翻译 | 示例

摘要

With the rapid proliferation of business process model collections, a fast and efficient systems to find process models from hundreds or thousands model is necessary. Similarity search or matching is one aspect needed to manage these collections, which consists to compare process models and select the fitted one to a query model. A graph based approaches for process model matching is very efficient in terms of accuracy. However, the complexity of graph matching algorithms grows exponentially with the size of graphs. In this paper, we propose an approach based on vectorial signatures to compare and evaluate the similarity of process models. To reduce the complexity of matching, we split the process graphs into paths, then calculate their similarity based on the similarity of the different vectorial signatures of their paths. Experimental evaluations show the performance of our approach using the precision and recall measures.
机译:随着业务流程模型集合的迅速增长,需要一种快速有效的系统来从数百个或数千个模型中查找流程模型。相似性搜索或匹配是管理这些集合所需要的一个方面,该方面包括比较过程模型并选择适合查询模型的模型。就准确性而言,基于图形的过程模型匹配方法非常有效。但是,图匹配算法的复杂度随图的大小呈指数增长。在本文中,我们提出了一种基于矢量签名的方法来比较和评估过程模型的相似性。为了降低匹配的复杂性,我们将过程图分成多个路径,然后根据其路径的不同矢量签名的相似度来计算它们的相似度。实验评估通过精确度和召回率方法显示了我们方法的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号