计算机科学 ›› 2023, Vol. 50 ›› Issue (6A): 210800242-7.doi: 10.11896/jsjkx.210800242

• 软件&交叉 • 上一篇    下一篇

基于多目特征交叉的服务推荐算法

高文斌1, 王睿1, 祖家琛1, 董晨辰2, 胡谷雨1   

  1. 1 陆军工程大学指挥控制工程学院 南京 210007;
    2 蚌埠学院计算机与信息工程学院 安徽 蚌埠 233000
  • 出版日期:2023-06-10 发布日期:2023-06-12
  • 通讯作者: 胡谷雨(hugugu@189.con)
  • 作者简介:(wenbinnj@qq.com)
  • 基金资助:
    国家自然科学基金(62076251)

Service Recommendation Algorithm Based on Multi-features Crossing

GAO Wenbin1, WANG Rui1, ZU Jiachen1, DONG Chenchen2, HU Guyu1   

  1. 1 School of Command, Control Engineering, Army Engineering University of PLA, Nanjing 210007, China;
    2 School of Computer Science and Information Engineering,Bengbu University,Bengbu,Anhui 233000,China
  • Online:2023-06-10 Published:2023-06-12
  • About author:GAO Wenbin,born in 1995,postgraduate.His main research interests include big data application and services computing. HU Guyu,born in 1963,Ph.D,professor,Ph.D supervisor.His main research interests include computer networks,administration of the satellite networks and intelligent network management.
  • Supported by:
    National Natural Science Foundation of China(62076251).

摘要: 随着Web服务数量的迅速增长,服务过载的问题逐步显现。为了解决服务过载的问题,帮助用户快速定位高质量服务,服务推荐成为了服务计算领域的研究热点。针对目前服务推荐中冷启动及数据稀疏的难点问题,提出了一种基于多目特征交叉的服务质量(Quality of Service,QoS)预测推荐算法(Service Recommendation Algorithm Based on Multi-features Crossing,SRMFC),通过“词嵌入”方法实现多目特征的引入,提升算法在应对冷启动时的表现;同时,应用神经网络完成多目特征的自动交叉,相比于传统协同过滤(Collaborative Filtering,CF)、因子分解机(Factorization Machine,FM)等方法,该算法能实现特征之间相互关系的深入挖掘,从而提升算法在应对数据极度稀疏场景下的学习能力。在公共数据集上的实验结果表明,基于多目特征交叉的服务推荐算法在不同数据稀疏性场景下,相比于近几年主流的服务推荐算法,服务质量预测误差至少降低20%。

关键词: 服务过载, 冷启动, 数据稀疏, QoS预测, 服务推荐

Abstract: With the rapid growth of the number of web services,the problem of service overload has gradually emerged.To relieve service overload,and help users position high-quality services rapidly,service recommendation has become a hot research topic in the field of service computing.Aiming at the difficulties of cold start and data sparseness in current service recommendation,this paper proposes a quality of service(QoS) prediction recommendation algorithm SRMFC based on the multi-features crossing,which implements multi-features through the “word embedding” method to improve the performance of the algorithm in dealing with the cold start.At the same time,a neural network is used to complete the automatic cross of multi-features.Compared with traditional collaborative filtering,factorization machine and other methods,the proposed algorithm can achieve in-depth exploration of the relationship between features,and improve the learning ability of the algorithm in dealing with extremely sparse data scenarios.Experiments on public data sets show that,under different data sparsity scenarios,the service quality prediction error of the SRMCF intersection decrease by at least 20% compared with the mainstream service recommendation algorithm in recent years.

Key words: Service overload, Cold start, Data sparseness, QoS prediction, Service recommendation

中图分类号: 

  • TP301
[1]AL-MASRI E,MAHMOUD Q H.Discovering the best webservice:A neural network-based solution[C]//IEEE International Conference on Systems.San Antonio IEEE,2009.
[2]LIN X Y,LIU X Q,TANG M D,et al.An empirical study of correlation between Web service QoS and user location[J].2013,35(9):83-88.
[3]PEERZADE S S.Web service recommendation using PCC based collaborative filtering[C]//2017 International Conference on Energy,Communication,Data Analytics and Soft Computing(ICECDS).IEEE,2018.
[4]XU K,ZHU X K,JING X Y.Research on Personalized Web Service Recommendation Based on Improved Collaborative Filtering[J].Computer Technology and Development,2018,28(1):64-68.
[5]WANG S,ZHAO Y,HUANG L,et al.QoS prediction forservice recommendations in mobile edge computing[J].Journal of Parallel & Distributed Computing,2017,127(MAY):134-144.
[6]CHEN Z,SHEN L,LI F,et al.Web service QoS prediction:when collaborative filtering meets data fluctuating in big-range[J].World Wide Web,2020,23(3):1715-1740.
[7]ZHANG X J,WANG Z J,ZHANG W J.Personalized Web Ser-vices Recommendation Based on Hybrid Collaborative Filtering Algorithm[J].Journal of Frontiers of Computer Science and Technology,2015,9(5):565-574.
[8]SULLIVAN A,CATUR CANDRA M Z.Web Service Recommendation System using History and Quality of Service[C]//2019 International Conference on Data and Software Enginee-ring(ICoDSE).2019:1-6.
[9]ADELI S,MORADI P.QoS-based Web Service Recommendation using Popular-dependent Collaborative Filtering[J].Joural of AI and Data Mining,2020,8(1):83-93.
[10]SUN D,NIE T.A web service recommendation algorithm based on BaisSVD[C]//2020 IEEE 5th Information Technology and Mechatronics Engineering Conference (ITOEC).2020:29-32.
[11]CHANG Z,DING D,XIA Y.A graph-based QoS prediction approach for web service recommendation[J].Applied Intelligence,2021,51:6728-6742.
[12]TANG M D,ZHANG T T,YANG Y T,et al.Quality-awareWeb service recommendation method based on factorization machine[J].Chinese Journal of Computers,2018,41(6):1300-1313.
[13]SHAN Y,HONES T R,JIAO J,et al.Deep Crossing:Web-Scale Modeling without Manually Crafted Combinatorial Features[C]//The 22nd ACM SIGKDD International Conference.San Francisco,United States,ACM,2016.
[14]ZHENG Z B,LYU M R.WS-DREAM:A distributed reliability assessment Mechanism for Web Services[C]//2008 IEEE International Conference on Dependable Systems and Networks With FTCS and DCC(DSN).2008:392-397.
[15]TANG N,XIONG Q Y,WANG X B,et al.Web service recommendation based on location clustering and tensor decomposition[J].CEA,2016,52(15):65-72.
[16]BOTANGEN K A,YU J,SHENGQ Z,et al.Geographic-aware Collaborative Filtering for Web Service Recommendation[J].Expert Systems with Applications,2020,151:113347.
[17]SHAO L,ZHANG J,WEI Y,et al.Personalized QoS prediction for web services via collaborative filtering[C]//IEEE Interna-tional Conference on Web Services.Salt Lake City,UT,2007:439-446.
[18]SARWAR B,KARYPIS G,KONSTAN J,et al.Item-based collaborative filtering recommendation algorithms[C]//Procee-dings of International Conference on World Wide Web.ACM Press,2001:285-295.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!