Light Heterogeneous Hypergraph Contrastive Learning Based Service Recommendation for Mashup Creation

IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Services Computing Pub Date : 2024-10-31 DOI:10.1109/TSC.2024.3489417
Mingdong Tang;Jiajin Mai;Fenfang Xie;Zibin Zheng
{"title":"Light Heterogeneous Hypergraph Contrastive Learning Based Service Recommendation for Mashup Creation","authors":"Mingdong Tang;Jiajin Mai;Fenfang Xie;Zibin Zheng","doi":"10.1109/TSC.2024.3489417","DOIUrl":null,"url":null,"abstract":"Mashup technology enables developers to create new applications more readily by combining existing services. As its popularity grows, research on service recommendation for mashup creation has gained increasing attention. Existing recommendation methods have the following limitations: either they are susceptible to data sparsity problems, or they exhibit over-smoothing when aggregating high-order neighbors, resulting in similar and non-specific node feature representations, or they only focus on bipartite graphs and neglect the rich heterogeneous information in the mashup-service ecosystem. To address these issues, we propose a service recommendation method for mashup creation based on \n<underline>l</u>\night \n<underline>h</u>\neterogeneous hyper\n<underline>g</u>\nraph \n<underline>c</u>\nontrastive \n<underline>l</u>\nearning (LHGCL). This method first constructs a heterogeneous hypergraph by combining mashup information, service information, the mashup-service interaction data, and their related attribute information. Then, it designs a light hypergraph neural network to capture the high-order relationships between mashups and services. Next, it applies contrastive learning to enhance the representations of mashups and services. Finally, it utilizes the enhanced feature vectors of mashups and services to predict mashup preferences for services. Comprehensive experiments conducted on the real-world ProgrammableWeb dataset demonstrate the superiority of the proposed method and the effectiveness of its key modules.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"17 6","pages":"3844-3856"},"PeriodicalIF":5.5000,"publicationDate":"2024-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10740331/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Mashup technology enables developers to create new applications more readily by combining existing services. As its popularity grows, research on service recommendation for mashup creation has gained increasing attention. Existing recommendation methods have the following limitations: either they are susceptible to data sparsity problems, or they exhibit over-smoothing when aggregating high-order neighbors, resulting in similar and non-specific node feature representations, or they only focus on bipartite graphs and neglect the rich heterogeneous information in the mashup-service ecosystem. To address these issues, we propose a service recommendation method for mashup creation based on l ight h eterogeneous hyper g raph c ontrastive l earning (LHGCL). This method first constructs a heterogeneous hypergraph by combining mashup information, service information, the mashup-service interaction data, and their related attribute information. Then, it designs a light hypergraph neural network to capture the high-order relationships between mashups and services. Next, it applies contrastive learning to enhance the representations of mashups and services. Finally, it utilizes the enhanced feature vectors of mashups and services to predict mashup preferences for services. Comprehensive experiments conducted on the real-world ProgrammableWeb dataset demonstrate the superiority of the proposed method and the effectiveness of its key modules.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于轻型异构超图对比学习的混搭创建服务推荐
Mashup技术使开发人员能够通过组合现有服务更容易地创建新的应用程序。随着mashup的普及,mashup创建服务推荐的研究也越来越受到关注。现有的推荐方法存在以下局限性:要么容易受到数据稀疏性问题的影响,要么在聚合高阶邻居时表现出过度平滑,导致相似且不特定的节点特征表示,要么只关注二部图而忽略了mashp -service生态系统中丰富的异构信息。为了解决这些问题,我们提出了一种基于轻异构超图对比学习(LHGCL)的mashup创建服务推荐方法。该方法首先通过组合mashup信息、服务信息、mashup-服务交互数据及其相关属性信息,构建一个异构超图。然后,设计了一个轻超图神经网络来捕捉混搭与服务之间的高阶关系。接下来,它应用对比学习来增强mashup和服务的表示。最后,它利用增强的mashup和服务的特征向量来预测服务的mashup首选项。在实际的ProgrammableWeb数据集上进行的综合实验证明了该方法的优越性和关键模块的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Services Computing
IEEE Transactions on Services Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
11.50
自引率
6.20%
发文量
278
审稿时长
>12 weeks
期刊介绍: IEEE Transactions on Services Computing encompasses the computing and software aspects of the science and technology of services innovation research and development. It places emphasis on algorithmic, mathematical, statistical, and computational methods central to services computing. Topics covered include Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, and Services Operations and Management. The transactions address mathematical foundations, security, privacy, agreement, contract, discovery, negotiation, collaboration, and quality of service for web services. It also covers areas like composite web service creation, business and scientific applications, standards, utility models, business process modeling, integration, collaboration, and more in the realm of Services Computing.
期刊最新文献
Lightweight and Privacy-Preserving Reconfigurable Authentication Scheme for IoT Devices Online Service Placement, Task Scheduling, and Resource Allocation in Hierarchical Collaborative MEC Systems Towards Cost-Optimal Policies for DAGs to Utilize IaaS Clouds with Online Learning Enhancing Federated Learning through Layer-wise Aggregation over Non-IID Data TrustPay: A Dual-Layer Blockchain-based Framework for Trusted Service Transaction
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1