QoS prediction of cloud services by selective ensemble learning on prefilling-based matrix factorizations

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Chengying Mao, Jifu Chen, Dave Towey, Zhuang Zhao, Linlin Wen
{"title":"QoS prediction of cloud services by selective ensemble learning on prefilling-based matrix factorizations","authors":"Chengying Mao,&nbsp;Jifu Chen,&nbsp;Dave Towey,&nbsp;Zhuang Zhao,&nbsp;Linlin Wen","doi":"10.1002/cpe.8282","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>When selecting services from a cloud center to build applications, the quality of service (QoS) is an important nonfunctional attribute to be considered. However, in actual application scenarios, the QoS details for many services may not be available. This has led to a situation where prediction of the missing QoS records for services has become a key problem for service selection. This article presents a selective ensemble learning (SEL) framework for prefilling-based matrix factorization (PFMF) predictors. In each PFMF predictor, the improved collaborative filtering is defined by examining the stability of the QoS records when measuring the similarity of users (or services), and then used to prefill empty records in the initial QoS matrix. To ensure the diversity of the basic PFMF predictors, various prefilled QoS matrices are constructed for the matrix factorization. In this process, different reference weights are assigned to the original and the prefilled QoS records. Finally, particle swarm optimization is used to set the ensemble weights for the basic PFMF predictors. The proposed SEL on PFMF (SEL-PFMF) algorithm is validated on a public dataset, where its prediction performance outperforms the state-of-the-art algorithms, and also shows good stability.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 27","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8282","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

When selecting services from a cloud center to build applications, the quality of service (QoS) is an important nonfunctional attribute to be considered. However, in actual application scenarios, the QoS details for many services may not be available. This has led to a situation where prediction of the missing QoS records for services has become a key problem for service selection. This article presents a selective ensemble learning (SEL) framework for prefilling-based matrix factorization (PFMF) predictors. In each PFMF predictor, the improved collaborative filtering is defined by examining the stability of the QoS records when measuring the similarity of users (or services), and then used to prefill empty records in the initial QoS matrix. To ensure the diversity of the basic PFMF predictors, various prefilled QoS matrices are constructed for the matrix factorization. In this process, different reference weights are assigned to the original and the prefilled QoS records. Finally, particle swarm optimization is used to set the ensemble weights for the basic PFMF predictors. The proposed SEL on PFMF (SEL-PFMF) algorithm is validated on a public dataset, where its prediction performance outperforms the state-of-the-art algorithms, and also shows good stability.

通过基于预填充矩阵因式分解的选择性集合学习预测云服务质量
摘要从云中心选择服务来构建应用程序时,服务质量(QoS)是需要考虑的一个重要的非功能属性。然而,在实际应用场景中,许多服务的 QoS 细节可能无法获得。这就导致预测服务缺失的 QoS 记录成为服务选择的关键问题。本文为基于预填充的矩阵因式分解(PFMF)预测器提出了一个选择性集合学习(SEL)框架。在每个 PFMF 预测器中,改进的协同过滤都是通过考察用户(或服务)相似性时 QoS 记录的稳定性来定义的,然后用来预填初始 QoS 矩阵中的空记录。为了确保基本 PFMF 预测器的多样性,需要为矩阵因式分解构建各种预填充 QoS 矩阵。在此过程中,会为原始 QoS 记录和预填充 QoS 记录分配不同的参考权重。最后,使用粒子群优化来设置基本 PFMF 预测器的集合权重。所提出的基于 PFMF 的 SEL(SEL-PFMF)算法在一个公共数据集上进行了验证,其预测性能优于最先进的算法,并显示出良好的稳定性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信