Web service recommendation for mashup creation based on graph network

被引:3
|
作者
Yu, Ting [1 ,2 ]
Yu, Dongjin [1 ]
Wang, Dongjing [1 ]
Hu, Xueyou [1 ]
机构
[1] Hangzhou Dianzi Univ, Sch Comp Sci & Technol, Hangzhou 310018, Peoples R China
[2] JiaXing Nanhu Univ, Jiaxing 314001, Peoples R China
来源
JOURNAL OF SUPERCOMPUTING | 2023年 / 79卷 / 08期
基金
中国国家自然科学基金;
关键词
Service recommendation; Recommender system; Mashup development; GraphGAN; BERT; QOS PREDICTION;
D O I
10.1007/s11227-022-05011-3
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In recent years, the world has witnessed the increased maturity of service-oriented computing. The mashup, as one of the typical service-based applications, aggregates contents from more than one source into a single user interface. Facing the rapid growth of the number of web services, choosing appropriate web services for dif-ferent mashup sources plays an important issue in mashup development, when, in particular, the new mashup is developed from the scratch. To solve this cold start problem when creating new mashups, we propose a web Service Recommenda-tion approach for Mashup creation based on Graph network, called SRMG. SRMG makes service recommendation based on service characteristics and historical usage. It first leverages Bidirectional Encoder Representations from Transformers, to intel-ligently discover mashups with similar functionalities based on specifications. After-ward, it employs GraphGAN to obtain representation vectors for mashups and ser-vices based on historical usage, and further obtains mashup preferences for each service based on representation vectors. Finally, the new mashup's preference for target services is derived from the preference of existing mashups that are similar to it. The extensive experiments on real datasets from ProgrammableWeb demonstrate that SRMG is superior to the state-of-the-art ones.
引用
下载
收藏
页码:8993 / 9020
页数:28
相关论文
共 50 条
  • [1] Web service recommendation for mashup creation based on graph network
    Ting Yu
    Dongjin Yu
    Dongjing Wang
    Xueyou Hu
    The Journal of Supercomputing, 2023, 79 : 8993 - 9020
  • [2] Web API service recommendation for Mashup creation
    Xu, Gejing
    Lian, Sixian
    Tang, Mingdong
    INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING, 2023, 26 (01) : 45 - 53
  • [3] DySR: A Dynamic Graph Neural Network Based Service Bundle Recommendation Model for Mashup Creation
    Liu, Mingyi
    Tu, Zhiying
    Xu, Hanchuan
    Xu, Xiaofei
    Wang, Zhongjie
    IEEE TRANSACTIONS ON SERVICES COMPUTING, 2023, 16 (04) : 2592 - 2605
  • [4] PRKG: Pre-Training Representation and Knowledge-Graph-Enhanced Web Service Recommendation for Mashup Creation
    Cao, Buqing
    Peng, Mi
    Xie, Ziming
    Liu, Jianxun
    Ye, Hongfan
    Li, Bing
    Fletcher, Kenneth K.
    IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2024, 21 (02): : 1737 - 1749
  • [5] Mashup Service Recommendation Based on Usage History and Service Network
    Cao, Buqing
    Liu, Jianxun
    Tang, Mingdong
    Zheng, Zibin
    Wang, Guangrong
    INTERNATIONAL JOURNAL OF WEB SERVICES RESEARCH, 2013, 10 (04) : 82 - 101
  • [6] API recommendation for Mashup creation based on neural graph collaborative filtering
    Lian, Sixian
    Tang, Mingdong
    CONNECTION SCIENCE, 2022, 34 (01) : 124 - 138
  • [7] A Novel Service Recommendation Approach in Mashup Creation
    Zhang, Yanmei
    Geng, Xiao
    Deng, Shuiguang
    INTELLIGENT AUTOMATION AND SOFT COMPUTING, 2019, 25 (03): : 513 - 525
  • [8] Web Service Instant Recommendation for Sustainable Service Mashup
    Zhang, Feng
    Chen, Benming
    Liu, Cong
    SUSTAINABILITY, 2020, 12 (20) : 1 - 18
  • [9] Multi-Relational Graph Convolution Network for Service Recommendation in Mashup Development
    Gao, Wei
    Wu, Jian
    APPLIED SCIENCES-BASEL, 2022, 12 (02):
  • [10] Integrated Content and Network-Based Service Clustering and Web APIs Recommendation for Mashup Development
    Cao B.
    Liu X.
    Rahman M.D.M.
    Li B.
    Liu J.
    Tang M.
    IEEE Transactions on Services Computing, 2020, 13 (01): : 99 - 113