用于时间感知 QoS 预测的有效图形建模和对比学习

IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Services Computing Pub Date : 2024-10-11 DOI:10.1109/TSC.2024.3478836
Hao Wu;Shuting Tian;Binbin Jin;Yiji Zhao;Lei Zhang
{"title":"用于时间感知 QoS 预测的有效图形建模和对比学习","authors":"Hao Wu;Shuting Tian;Binbin Jin;Yiji Zhao;Lei Zhang","doi":"10.1109/TSC.2024.3478836","DOIUrl":null,"url":null,"abstract":"Accurate and reliable service quality prediction has become a key issue in service recommendation and network measurement scenarios. However, traditional methods for time-aware QoS prediction face two main challenges: (I) data sparsity makes it difficult to estimate and recover global information from the limited known data; (II) shallow learning models struggle to represent the intricate relationships between objects, and thus suffer poor prediction performance. To this end, we propose a time-aware QoS prediction framework that combines the merits of graph modeling, graph representation learning, and contrastive learning. First, a novel graph schema is proposed to capture the complex interactions between user-service-slots. Then, a prediction model is developed leveraging a graph convolutional network to learn the node representations by aggregating feature information from neighboring nodes. Finally, a novel contrastive learning strategy is used to improve the robustness of node representation. Experimental results on a large-scale dataset demonstrated that our proposed method significantly outperforms the state-of-the-art prediction methods on response time and throughput prediction tasks.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"17 6","pages":"3513-3526"},"PeriodicalIF":5.5000,"publicationDate":"2024-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Effective Graph Modeling and Contrastive Learning for Time-Aware QoS Prediction\",\"authors\":\"Hao Wu;Shuting Tian;Binbin Jin;Yiji Zhao;Lei Zhang\",\"doi\":\"10.1109/TSC.2024.3478836\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Accurate and reliable service quality prediction has become a key issue in service recommendation and network measurement scenarios. However, traditional methods for time-aware QoS prediction face two main challenges: (I) data sparsity makes it difficult to estimate and recover global information from the limited known data; (II) shallow learning models struggle to represent the intricate relationships between objects, and thus suffer poor prediction performance. To this end, we propose a time-aware QoS prediction framework that combines the merits of graph modeling, graph representation learning, and contrastive learning. First, a novel graph schema is proposed to capture the complex interactions between user-service-slots. Then, a prediction model is developed leveraging a graph convolutional network to learn the node representations by aggregating feature information from neighboring nodes. Finally, a novel contrastive learning strategy is used to improve the robustness of node representation. Experimental results on a large-scale dataset demonstrated that our proposed method significantly outperforms the state-of-the-art prediction methods on response time and throughput prediction tasks.\",\"PeriodicalId\":13255,\"journal\":{\"name\":\"IEEE Transactions on Services Computing\",\"volume\":\"17 6\",\"pages\":\"3513-3526\"},\"PeriodicalIF\":5.5000,\"publicationDate\":\"2024-10-11\",\"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/10713972/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10713972/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

准确可靠的服务质量预测已成为服务推荐和网络测量场景中的关键问题。然而,传统的时间感知QoS预测方法面临两个主要挑战:(1)数据稀疏性使得从有限的已知数据中难以估计和恢复全局信息;(2)浅学习模型难以表示对象之间错综复杂的关系,因此预测性能较差。为此,我们提出了一个时间感知的QoS预测框架,该框架结合了图建模、图表示学习和对比学习的优点。首先,提出了一种新的图模式来捕获用户-服务槽之间复杂的交互。然后,利用图卷积网络通过聚合相邻节点的特征信息来学习节点表示,建立预测模型。最后,采用一种新的对比学习策略来提高节点表示的鲁棒性。在大规模数据集上的实验结果表明,我们提出的方法在响应时间和吞吐量预测任务上明显优于最先进的预测方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Effective Graph Modeling and Contrastive Learning for Time-Aware QoS Prediction
Accurate and reliable service quality prediction has become a key issue in service recommendation and network measurement scenarios. However, traditional methods for time-aware QoS prediction face two main challenges: (I) data sparsity makes it difficult to estimate and recover global information from the limited known data; (II) shallow learning models struggle to represent the intricate relationships between objects, and thus suffer poor prediction performance. To this end, we propose a time-aware QoS prediction framework that combines the merits of graph modeling, graph representation learning, and contrastive learning. First, a novel graph schema is proposed to capture the complex interactions between user-service-slots. Then, a prediction model is developed leveraging a graph convolutional network to learn the node representations by aggregating feature information from neighboring nodes. Finally, a novel contrastive learning strategy is used to improve the robustness of node representation. Experimental results on a large-scale dataset demonstrated that our proposed method significantly outperforms the state-of-the-art prediction methods on response time and throughput prediction tasks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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.
期刊最新文献
Intelligent Transaction Generation Control for Permissioned Blockchain-based Services Large-Scale Service Mesh Orchestration with Probabilistic Routing in Cloud Data Centers Federated Contrastive Learning for Cross-Domain Recommendation LogNotion: Highlighting Massive Logs to Assist Human Reading and Decision Making A Hybrid Optimization Framework for Age of Information Minimization in UAV-assisted MCS
×
引用
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