Service Recommendation based on Attentional Factorization Machine

被引:26
作者
Cao, Yingcheng [1 ]
Liu, Jianxun [1 ]
Shi, Min [1 ]
Cao, Buqing [1 ]
Chen, Ting [1 ]
Wen, Yiping [1 ]
机构
[1] Hunan Univ Sci & Technol, Key Lab Knowledge Proc & Networked Mfg, Sch Comp Sci & Engn, Xiangtan 411100, Peoples R China
来源
2019 IEEE INTERNATIONAL CONFERENCE ON SERVICES COMPUTING (IEEE SCC 2019) | 2019年
基金
中国国家自然科学基金;
关键词
Service recommendation; Doc2vec model; Matrix factorization; Factorization machine; Attentional factorization machine;
D O I
10.1109/SCC.2019.00040
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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 thatthe proposed approach significantly improves the quality of the recommendation results while compared with up-to-date ones.
引用
收藏
页码:189 / 196
页数:8
相关论文
共 26 条
[1]  
[Anonymous], 2013, APPL LOGISTIC REGRES
[2]  
[Anonymous], P IEEE C COMP VIS PA
[3]  
[Anonymous], 2001, ADV NEURAL INF PROCE
[4]   Latent Dirichlet allocation [J].
Blei, DM ;
Ng, AY ;
Jordan, MI .
JOURNAL OF MACHINE LEARNING RESEARCH, 2003, 3 (4-5) :993-1022
[5]   Attentive Collaborative Filtering: Multimedia Recommendation with Item- and Component-Level Attention [J].
Chen, Jingyuan ;
Zhang, Hanwang ;
He, Xiangnan ;
Nie, Liqiang ;
Liu, Wei ;
Chua, Tat-Seng .
SIGIR'17: PROCEEDINGS OF THE 40TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2017, :335-344
[6]   Web Service Recommendation via Exploiting Location and QoS Information [J].
Chen, Xi ;
Zheng, Zibin ;
Yu, Qi ;
Lyu, Michael R. .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (07) :1913-1924
[7]   SINGULAR VALUE DECOMPOSITION AND LEAST SQUARES SOLUTIONS [J].
GOLUB, GH ;
REINSCH, C .
NUMERISCHE MATHEMATIK, 1970, 14 (05) :403-&
[8]   THE MEANING AND USE OF THE AREA UNDER A RECEIVER OPERATING CHARACTERISTIC (ROC) CURVE [J].
HANLEY, JA ;
MCNEIL, BJ .
RADIOLOGY, 1982, 143 (01) :29-36
[9]  
Kingma DP, 2014, ARXIV
[10]   Revisiting squared-error and cross-entropy functions for training neural network classifiers [J].
Kline, DM ;
Berardi, VL .
NEURAL COMPUTING & APPLICATIONS, 2005, 14 (04) :310-318