LS3: Latent Semantic Analysis-based Similarity Search for Process Models

Andreas Schoknecht, A. Oberweis
{"title":"LS3: Latent Semantic Analysis-based Similarity Search for Process Models","authors":"Andreas Schoknecht, A. Oberweis","doi":"10.18417/emisa.12.2","DOIUrl":null,"url":null,"abstract":"Please note that due to an editorial mishap, the PDF of this publication had to be changed on 2017-10-19 (marked as ‘corrected version’). Large process model collections in use today contain hundreds or even thousands of conceptual process models. Search functionalities can help in handling such large collections for purposes such as duplicate detection or reuse of models. One popular stream of search functionalities is similarity-based search which utilizes similarity measures for finding similar models in a large collection. Most of these approaches base on an underlying alignment between the activities of the compared process models. Yet, such an alignment seems to be quite difficult to achieve according to the results of the Process Model Matching contests conducted in recent years. Therefore, the Latent Semantic Analysis-based Similarity Search (LS3) technique presented in this article does not rely on such an alignment, but uses a Latent Semantic Analysis-based similarity measure for retrieving similar models. An evaluation with 138 real-life process models shows a strong performance in terms of Precision, Recall, F-Measure, R-Precision and Precision-at-k, thereby outperforming five other techniques for similarity-based search. Additionally, the run time of the LS3 query calculation is significantly faster than any of the other approaches.","PeriodicalId":186216,"journal":{"name":"Enterp. Model. Inf. Syst. Archit. Int. J. Concept. Model.","volume":"127 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Enterp. Model. Inf. Syst. Archit. Int. J. Concept. Model.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18417/emisa.12.2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Please note that due to an editorial mishap, the PDF of this publication had to be changed on 2017-10-19 (marked as ‘corrected version’). Large process model collections in use today contain hundreds or even thousands of conceptual process models. Search functionalities can help in handling such large collections for purposes such as duplicate detection or reuse of models. One popular stream of search functionalities is similarity-based search which utilizes similarity measures for finding similar models in a large collection. Most of these approaches base on an underlying alignment between the activities of the compared process models. Yet, such an alignment seems to be quite difficult to achieve according to the results of the Process Model Matching contests conducted in recent years. Therefore, the Latent Semantic Analysis-based Similarity Search (LS3) technique presented in this article does not rely on such an alignment, but uses a Latent Semantic Analysis-based similarity measure for retrieving similar models. An evaluation with 138 real-life process models shows a strong performance in terms of Precision, Recall, F-Measure, R-Precision and Precision-at-k, thereby outperforming five other techniques for similarity-based search. Additionally, the run time of the LS3 query calculation is significantly faster than any of the other approaches.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于潜在语义分析的过程模型相似度搜索
请注意,由于编辑失误,本出版物的PDF必须在2017-10-19进行更改(标记为“更正版本”)。目前使用的大型流程模型集合包含数百甚至数千个概念流程模型。搜索功能可以帮助处理如此大的集合,以实现重复检测或模型重用等目的。一种流行的搜索功能流是基于相似性的搜索,它利用相似性度量在大型集合中查找相似的模型。这些方法大多基于所比较的流程模型的活动之间的基本一致性。然而,根据近年来进行的流程模型匹配竞赛的结果,这种对齐似乎很难实现。因此,本文中提出的基于潜在语义分析的相似性搜索(LS3)技术不依赖于这种对齐,而是使用基于潜在语义分析的相似性度量来检索相似模型。对138个现实生活过程模型的评估显示,该方法在Precision、Recall、F-Measure、R-Precision和Precision-at-k方面表现出色,从而优于其他五种基于相似性的搜索技术。此外,LS3查询计算的运行时间明显快于任何其他方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Catchword: Blockchains and Enterprise Modeling Decentralized Business Process Control using Blockchain An experience report from two applications: Food Supply Chain and Car Registration Balancing Patient Care and Paperwork Automatic Task Enactment and Comprehensive Documentation in Treatment Processes Process Modeling in Decentralized Organizations Utilizing Blockchain Consensus Blockchain Technologies in Enterprise Modeling and Enterprise Information Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1