基于结构化噪声矩阵补全的Web服务QoS预测  

Web services QoS prediction via matrix completion with structural noise

作　　者：陈蕾[1,2] 杨庚[1,2] 陈正宇[1] 肖甫[1] 许建[1] 

机构地区：[1]南京邮电大学计算机学院,江苏南京210003 [2]南京邮电大学宽带无线通信与传感网技术教育部重点实验室,江苏南京210003

出　　处：《通信学报》2015年第6期49-59,共11页Journal on Communications

基　　金：国家自然科学基金资助项目(61272084;61201163;61272422;61373137);江苏省自然科学基金资助项目(BK2011072;BK20130096);江苏省高校自然科学研究重大基金资助项目(11KJA520002);高等学校博士学科点专项科研基金资助项目(20113223110003)~~

摘　　要：随着面向服务计算技术的快速发展,越来越多具有相同或相似功能的Web服务被部署在网络上。用户进行服务选择之前,通常需要根据历史调用信息对未使用过的服务QoS进行预测。由于历史调用信息收集过程缺乏有效的监督和约束机制,所采样的QoS信息往往容易受到结构化噪声污染,从而导致现有方法预测性能急剧下降。为了克服这个困难,通过将Web服务QoS预测问题建模为L2,1范数正则化矩阵补全问题,提出了一类基于结构化噪声矩阵补全的Web服务QoS预测方法。真实数据集上的实验结果表明,该方法不仅能精确地辨识出QoS采样矩阵中噪声行所在位置,而且能对缺失Web服务QoS进行有效预测。With the rapid development of service-oriented computing, more and more Web services with the same or similar function are deployed on the Internet. Usually, before selecting the most suitable service, users need to predict QoS of unused services from the service invoking history. Due to the lack of effective supervision and constraint mechanisms, some number of the rows in the QoS sample matrix is often contaminated by the structural noise, which leads to a sharp decrease for QoS prediction performance. In order to address this problem, an efficient Web services QoS prediction approach via matrix completion with structural noise is proposed by formulating Web services QoS prediction problem as a L2,1-norm regularized matrix completion problem. The proposed approach can not only exactly detect the position where the data is contaminated, but also effectively predict the missing QoS values. Finally, experimental results performed on a real public dataset demonstrate the feasibility of our proposed approach.

关 键 词：WEB服务 QoS预测 矩阵补全 算子分裂 结构化噪声 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]