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.