过程模型匹配的谱图方法

2013 IEEE International Conference on Services Computing Pub Date : 2013-06-28 DOI:10.1109/SCC.2013.27

Y. Belhoul, Mohammed Haddad, A. Gater, Daniela Grigori, H. Kheddouci, M. Bouzeghoub

{"title":"过程模型匹配的谱图方法","authors":"Y. Belhoul, Mohammed Haddad, A. Gater, Daniela Grigori, H. Kheddouci, M. Bouzeghoub","doi":"10.1109/SCC.2013.27","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a novel approach for graph based web service matching. Our approach is inspired by spectral graph matching methods, in particular, by eigen-based projections. We introduce new mechanisms to perform the matchmaking at both structural and semantic levels. These mechanisms are based on algebraic graph techniques that make them run fast and thus suitable for large scale web service matching problems. Experimentation is provided to show the performance of the proposed approach.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"348 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Spectral Graph Approach for Process Model Matchmaking\",\"authors\":\"Y. Belhoul, Mohammed Haddad, A. Gater, Daniela Grigori, H. Kheddouci, M. Bouzeghoub\",\"doi\":\"10.1109/SCC.2013.27\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a novel approach for graph based web service matching. Our approach is inspired by spectral graph matching methods, in particular, by eigen-based projections. We introduce new mechanisms to perform the matchmaking at both structural and semantic levels. These mechanisms are based on algebraic graph techniques that make them run fast and thus suitable for large scale web service matching problems. Experimentation is provided to show the performance of the proposed approach.\",\"PeriodicalId\":370898,\"journal\":{\"name\":\"2013 IEEE International Conference on Services Computing\",\"volume\":\"348 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE International Conference on Services Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCC.2013.27\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Services Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCC.2013.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

本文提出了一种新的基于图的web服务匹配方法。我们的方法受到谱图匹配方法的启发，特别是基于特征的投影。我们引入了新的机制来执行结构和语义层面的匹配。这些机制基于代数图技术，使它们运行速度很快，因此适合于大规模的web服务匹配问题。实验证明了该方法的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Spectral Graph Approach for Process Model Matchmaking

In this paper, we propose a novel approach for graph based web service matching. Our approach is inspired by spectral graph matching methods, in particular, by eigen-based projections. We introduce new mechanisms to perform the matchmaking at both structural and semantic levels. These mechanisms are based on algebraic graph techniques that make them run fast and thus suitable for large scale web service matching problems. Experimentation is provided to show the performance of the proposed approach.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2013 IEEE International Conference on Services Computing

自引率

0.00%

发文量