支持Mashup推荐的细粒度API链接预测方法

Q. Bao, Jia Zhang, Xiaoyi Duan, R. Ramachandran, Tsengdar J. Lee, Yankai Zhang, Yuhao Xu, Seungwon Lee, L. Pan, P. Gatlin, M. Maskey
{"title":"支持Mashup推荐的细粒度API链接预测方法","authors":"Q. Bao, Jia Zhang, Xiaoyi Duan, R. Ramachandran, Tsengdar J. Lee, Yankai Zhang, Yuhao Xu, Seungwon Lee, L. Pan, P. Gatlin, M. Maskey","doi":"10.1109/ICWS.2017.36","DOIUrl":null,"url":null,"abstract":"Service (API) discovery and recommendation is key to the wide spread of service oriented architecture and service oriented software engineering. Service recommendation typically relies on service linkage prediction calculated by the semantic distances (or similarities) among services based on their collection of inherent attributes. Given a specific context (mashup goal), however, different attributes may contribute differently to a service linkage. In this paper, instead of training a model for all attributes as a whole, a novel approach is presented to simultaneously train separate models for individual attributes. Meanwhile, a latent attribute modeling method is developed to reveal context-aware attribute distribution. Experiments over real-world datasets have demonstrated that this fine-grained method yields higher link prediction accuracy.","PeriodicalId":235426,"journal":{"name":"2017 IEEE International Conference on Web Services (ICWS)","volume":"29 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A Fine-Grained API Link Prediction Approach Supporting Mashup Recommendation\",\"authors\":\"Q. Bao, Jia Zhang, Xiaoyi Duan, R. Ramachandran, Tsengdar J. Lee, Yankai Zhang, Yuhao Xu, Seungwon Lee, L. Pan, P. Gatlin, M. Maskey\",\"doi\":\"10.1109/ICWS.2017.36\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Service (API) discovery and recommendation is key to the wide spread of service oriented architecture and service oriented software engineering. Service recommendation typically relies on service linkage prediction calculated by the semantic distances (or similarities) among services based on their collection of inherent attributes. Given a specific context (mashup goal), however, different attributes may contribute differently to a service linkage. In this paper, instead of training a model for all attributes as a whole, a novel approach is presented to simultaneously train separate models for individual attributes. Meanwhile, a latent attribute modeling method is developed to reveal context-aware attribute distribution. Experiments over real-world datasets have demonstrated that this fine-grained method yields higher link prediction accuracy.\",\"PeriodicalId\":235426,\"journal\":{\"name\":\"2017 IEEE International Conference on Web Services (ICWS)\",\"volume\":\"29 3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE International Conference on Web Services (ICWS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICWS.2017.36\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on Web Services (ICWS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWS.2017.36","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

服务(API)的发现和推荐是面向服务的体系结构和面向服务的软件工程广泛传播的关键。服务推荐通常依赖于服务链接预测,该预测是根据服务之间的语义距离(或相似度)根据其固有属性集合计算的。然而,给定特定的上下文(mashup目标),不同的属性对服务链接的贡献可能不同。本文提出了一种针对单个属性同时训练单独模型的新方法,而不是针对所有属性作为一个整体来训练模型。同时,提出了一种潜在属性建模方法来揭示上下文感知的属性分布。在真实世界数据集上的实验表明,这种细粒度的方法可以产生更高的链接预测精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Fine-Grained API Link Prediction Approach Supporting Mashup Recommendation
Service (API) discovery and recommendation is key to the wide spread of service oriented architecture and service oriented software engineering. Service recommendation typically relies on service linkage prediction calculated by the semantic distances (or similarities) among services based on their collection of inherent attributes. Given a specific context (mashup goal), however, different attributes may contribute differently to a service linkage. In this paper, instead of training a model for all attributes as a whole, a novel approach is presented to simultaneously train separate models for individual attributes. Meanwhile, a latent attribute modeling method is developed to reveal context-aware attribute distribution. Experiments over real-world datasets have demonstrated that this fine-grained method yields higher link prediction accuracy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信