用于自动服务组合的语义api匹配

WWW Alt. '04 Pub Date : 2004-05-19 DOI:10.1145/1013367.1013513

Doina Caragea, T. Syeda-Mahmood

{"title":"用于自动服务组合的语义api匹配","authors":"Doina Caragea, T. Syeda-Mahmood","doi":"10.1145/1013367.1013513","DOIUrl":null,"url":null,"abstract":"In this paper, we address the problem of matching I/O descriptions of services to enable their automatic service composition. Specifically, we develop a method of semantic schema matching and apply it to the API schemas constituting the I/O descriptions of services. The algorithm assures an optimal match of corresponding entities by obtaining a maximum matching in a bi-partite graph formed from the attributes.","PeriodicalId":409891,"journal":{"name":"WWW Alt. '04","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Semantic api matching for automatic service composition\",\"authors\":\"Doina Caragea, T. Syeda-Mahmood\",\"doi\":\"10.1145/1013367.1013513\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we address the problem of matching I/O descriptions of services to enable their automatic service composition. Specifically, we develop a method of semantic schema matching and apply it to the API schemas constituting the I/O descriptions of services. The algorithm assures an optimal match of corresponding entities by obtaining a maximum matching in a bi-partite graph formed from the attributes.\",\"PeriodicalId\":409891,\"journal\":{\"name\":\"WWW Alt. '04\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"WWW Alt. '04\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1013367.1013513\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"WWW Alt. '04","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1013367.1013513","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 19

摘要

在本文中，我们解决了匹配服务的I/O描述以实现其自动服务组合的问题。具体来说，我们开发了一种语义模式匹配方法，并将其应用于构成服务I/O描述的API模式。该算法通过在由属性组成的二部图中获得最大匹配来保证对应实体的最优匹配。

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

查看原文本刊更多论文

Semantic api matching for automatic service composition

In this paper, we address the problem of matching I/O descriptions of services to enable their automatic service composition. Specifically, we develop a method of semantic schema matching and apply it to the API schemas constituting the I/O descriptions of services. The algorithm assures an optimal match of corresponding entities by obtaining a maximum matching in a bi-partite graph formed from the attributes.

求助全文

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

来源期刊

WWW Alt. '04

自引率

0.00%

发文量