Attentional Matrix Factorization with Document-context awareness and Implicit API Relationship for Service Recommendation

Mo Nguyen, Jian Yu, Quan Bai, Sira Yongchareon, Yanbo Han
{"title":"Attentional Matrix Factorization with Document-context awareness and Implicit API Relationship for Service Recommendation","authors":"Mo Nguyen, Jian Yu, Quan Bai, Sira Yongchareon, Yanbo Han","doi":"10.1145/3373017.3373034","DOIUrl":null,"url":null,"abstract":"The rapid development of the mashup approach significantly plays a pivot role in building Web-based and mobile applications. Easy accessibility of data and functions are the main advantages for programmers to develop mashups from abundant sources of APIs. However, it simultaneously brings more difficulties to choose suitable APIs for a mashup, especially when the historical relations between APIs and mashups are very sparse. Existing probabilistic matrix factorization (PMF) recommender systems can effectively exploit the latent features of the invocations with the same weight. However, not all features are equally significant and predictive, and the useless features may bring noises to the model. Also, many current works explored the influence of mashups’ relationships, but few of them sheds lights on the relationship between APIs and their contextual interaction, which can be mined from their content description. This paper improves the PMF model by distinguishing the importance of latent feature interactions. We present an Attentional PMF model, which leverages a neural attention network to learn the significance of feature interactions and uses Doc2Vec technique for mining the contextual information. We also exploit the relationship between APIs from both their contextual similarities and invocation history and add them to the prediction model as a regularization part. Our experiments are performed with datasets from ProgrammableWeb. The results show that our model significantly outperforms some state-of-art recommender systems in mashup service applications.","PeriodicalId":297760,"journal":{"name":"Proceedings of the Australasian Computer Science Week Multiconference","volume":"91 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Australasian Computer Science Week Multiconference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3373017.3373034","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

The rapid development of the mashup approach significantly plays a pivot role in building Web-based and mobile applications. Easy accessibility of data and functions are the main advantages for programmers to develop mashups from abundant sources of APIs. However, it simultaneously brings more difficulties to choose suitable APIs for a mashup, especially when the historical relations between APIs and mashups are very sparse. Existing probabilistic matrix factorization (PMF) recommender systems can effectively exploit the latent features of the invocations with the same weight. However, not all features are equally significant and predictive, and the useless features may bring noises to the model. Also, many current works explored the influence of mashups’ relationships, but few of them sheds lights on the relationship between APIs and their contextual interaction, which can be mined from their content description. This paper improves the PMF model by distinguishing the importance of latent feature interactions. We present an Attentional PMF model, which leverages a neural attention network to learn the significance of feature interactions and uses Doc2Vec technique for mining the contextual information. We also exploit the relationship between APIs from both their contextual similarities and invocation history and add them to the prediction model as a regularization part. Our experiments are performed with datasets from ProgrammableWeb. The results show that our model significantly outperforms some state-of-art recommender systems in mashup service applications.
基于文档上下文感知和隐式API关系的服务推荐注意矩阵分解
mashup方法的快速发展在构建基于web的应用程序和移动应用程序中发挥着重要的枢纽作用。数据和函数的易访问性是程序员从丰富的api资源中开发mashup的主要优势。然而,这同时也为mashup选择合适的api带来了更多的困难,尤其是在api和mashup之间的历史关系非常稀疏的情况下。现有的概率矩阵分解(PMF)推荐系统可以有效地利用具有相同权重的调用的潜在特征。然而,并不是所有的特征都具有同样的重要性和预测性,无用的特征可能会给模型带来噪声。此外,许多当前的作品探索了mashup关系的影响,但很少有作品揭示了api与其上下文交互之间的关系,这可以从它们的内容描述中挖掘出来。本文通过区分潜在特征相互作用的重要性来改进PMF模型。我们提出了一个注意力PMF模型,该模型利用神经注意网络来学习特征交互的重要性,并使用Doc2Vec技术来挖掘上下文信息。我们还从上下文相似性和调用历史中挖掘api之间的关系,并将它们作为正则化部分添加到预测模型中。我们的实验是用来自ProgrammableWeb的数据集进行的。结果表明,我们的模型在混搭服务应用程序中显著优于一些最先进的推荐系统。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信