Web service sub-chain recommendation leveraging graph searching

Zehui Cheng, Beibei Yao, Xiaolei Wang, Zhangbing Zhou
{"title":"Web service sub-chain recommendation leveraging graph searching","authors":"Zehui Cheng, Beibei Yao, Xiaolei Wang, Zhangbing Zhou","doi":"10.1109/ComComAp.2014.7017209","DOIUrl":null,"url":null,"abstract":"Nowadays an increasing number of Open Geospatial Consortium Web services (OWSs) is built and being available on the Web for the accessibility and processing of geospatial information. Typically, the specific requirement specified by a certain user can be satisfied by a chain of OWSs. In this setting, retrieving and recommending sub-chains of possible service invocations is critical. Leveraging the semantic similarity between the name and text description of parameters and operations, the degree that represents the invocation possibility between operations in OWSs is calculated. Thereafter, the service network model is constructed that captures the possible invocations between operations. Given a user's requirement represented in terms of the initial and ending operations, possible sub-chains of operations are retrieved, ranked and recommended. Based on which the user can select the most appropriate sub-chain with respect to her specific requirement.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"156 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Computers, Communications and IT Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ComComAp.2014.7017209","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Nowadays an increasing number of Open Geospatial Consortium Web services (OWSs) is built and being available on the Web for the accessibility and processing of geospatial information. Typically, the specific requirement specified by a certain user can be satisfied by a chain of OWSs. In this setting, retrieving and recommending sub-chains of possible service invocations is critical. Leveraging the semantic similarity between the name and text description of parameters and operations, the degree that represents the invocation possibility between operations in OWSs is calculated. Thereafter, the service network model is constructed that captures the possible invocations between operations. Given a user's requirement represented in terms of the initial and ending operations, possible sub-chains of operations are retrieved, ranked and recommended. Based on which the user can select the most appropriate sub-chain with respect to her specific requirement.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用图搜索的Web服务子链推荐
如今,越来越多的开放地理空间联盟Web服务(Open Geospatial Consortium Web services, OWSs)被构建并在Web上可用,用于地理空间信息的访问和处理。通常,某个用户指定的特定需求可以通过OWSs链来满足。在此设置中,检索和推荐可能的服务调用的子链至关重要。利用参数和操作的名称和文本描述之间的语义相似性,计算OWSs中操作之间调用可能性的程度。然后,构建服务网络模型,以捕获操作之间可能的调用。给定以初始和结束操作表示的用户需求,检索、排序和推荐可能的操作子链。在此基础上,用户可以根据自己的具体需求选择最合适的子链。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fast acquisition method of navigation receiver based on folded PMF-FFT Web service sub-chain recommendation leveraging graph searching Path prediction based on second-order Markov chain for the opportunistic networks A novel UEP resource allocation scheme for layered source transmission in COFDM systems Energy efficient scheduling with probability and task migration considerations for soft real-time 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