首页> 外文会议>IEEE International Conference on Services Computing >Service Recommendation Based on Attentional Factorization Machine
【24h】

Service Recommendation Based on Attentional Factorization Machine

机译:基于注意分解机的服务推荐

获取原文

摘要

With the increasing popularity of SOA (Service Oriented Architecture), a large body of innovative applications emerge on the Internet with mashup (e.g., composition of multiple Web APIs is a representative). Recommending suitable Web APIs to develop Mashup applications has received much attention from both research and industry communities. Prior efforts have shown the importance of incorporating multi-dimensional features extracted from a service repository into their recommendation models. Despite their effectiveness, they are insufficient by simply modelling all these features with the same importance degree, neglecting the fact that not all features are equally useful and predictive. Some useless features may even introduce noises and adversely degrade the performance. In this paper, we propose a novel service recommendation method, which tackles this challenge by discriminating the importance of each feature from data via Attentional Factorization Machine. It endows our model with better performance and a certain level of explainability. In this model, we first extract the valuable features implied in the raw dataset and subsequently transform them to the input format of Attentional Factorization Machine. Then, multi-dimensional information, such as functional similarity, tags, popularity of Web APIs, are modeled by Attentional Factorization Machine to predict the ratings between mashups and services. Comprehensive experiments on a real-world dataset indicate that the proposed approach significantly improves the quality of the recommendation results while compared with up-to-date ones.
机译:随着SOA的普及越来越普及(面向服务的架构),大量的创新应用程序在互联网上出现了Mashup(例如,多个Web API的组成是代表)。推荐合适的Web API开发Mashup应用程序从研究和行业社区接受了很多关注。事先努力表明,将从服务存储库中提取的多维功能结合到其推荐模型中的重要性。尽管他们有效性,但只需以相同的重视程度建模所有这些特征,它们都不足以忽视并非所有功能同样有用和预测的事实。一些无用的功能甚至可以引入噪音并对性能产生不利影响。在本文中,我们提出了一种新的服务推荐方法,通过鉴别通过注意性分解机来区分每个特征的重要性来解决这一挑战。它赋予我们的模型,具有更好的性能和一定程度的解释性。在该模型中,我们首先提取原始数据集中暗示的有价值的功能,随后将它们转换为注意力分解机的输入格式。然后,诸如功能相似性,标签,Web API的普及的多维信息由注意力分解机器建模,以预测MASHUP和服务之间的额定值。实际数据集的综合实验表明,与最新的方法相比,建议的方法显着提高了建议结果的质量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号