Efficient Tensor Completion for Internet Traffic Data Recovery

Yuanyuan Li, K. Yu, Xiaofei Wu
{"title":"Efficient Tensor Completion for Internet Traffic Data Recovery","authors":"Yuanyuan Li, K. Yu, Xiaofei Wu","doi":"10.1145/3291842.3291912","DOIUrl":null,"url":null,"abstract":"In real-world traffic data, missing data is inevitable for traffic collection problem and some other reasons. Therefore, it is increasingly critical to complete the whole traffic data. To make full use of hidden spatial-temporal structures of the Internet traffic data, we extend to traffic matrix (user, server) to a three-way tensor (user, server, time). This paper proposed a novel algorithm to recover the missing data, named TSVT (Tucker decomposition and tensor singular value thresholding). We exploit the proposed the Tucker decomposition and low rank tensor completion (LRTC). Based on LRTC, we extend the known singular value thresholding (SVT) to the tensor case, and combine Tucker decomposition to optimize the performance of the algorithm. Based on Internet traffic data, we model two different tensors, and apply our TSVT to infer the unobserved data of the traffic. Furthermore, we apply TSVT algorithm to our Internet data. Numerical experiments on Synthetic data verify our method and the application for completing DPI traffic data proves the effectiveness of the method.","PeriodicalId":283197,"journal":{"name":"Proceedings of the 2nd International Conference on Telecommunications and Communication Engineering","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2nd International Conference on Telecommunications and Communication Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3291842.3291912","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In real-world traffic data, missing data is inevitable for traffic collection problem and some other reasons. Therefore, it is increasingly critical to complete the whole traffic data. To make full use of hidden spatial-temporal structures of the Internet traffic data, we extend to traffic matrix (user, server) to a three-way tensor (user, server, time). This paper proposed a novel algorithm to recover the missing data, named TSVT (Tucker decomposition and tensor singular value thresholding). We exploit the proposed the Tucker decomposition and low rank tensor completion (LRTC). Based on LRTC, we extend the known singular value thresholding (SVT) to the tensor case, and combine Tucker decomposition to optimize the performance of the algorithm. Based on Internet traffic data, we model two different tensors, and apply our TSVT to infer the unobserved data of the traffic. Furthermore, we apply TSVT algorithm to our Internet data. Numerical experiments on Synthetic data verify our method and the application for completing DPI traffic data proves the effectiveness of the method.
高效张量补全的互联网流量数据恢复
在现实交通数据中,由于交通采集问题等原因,数据缺失是不可避免的。因此,完整的交通数据变得越来越重要。为了充分利用互联网流量数据隐藏的时空结构,我们将流量矩阵(用户、服务器)扩展为一个三向张量(用户、服务器、时间)。本文提出了一种新的恢复缺失数据的算法,称为TSVT (Tucker decomposition and tensor singular value threshold)。我们利用提出的Tucker分解和低秩张量补全(LRTC)。在LRTC的基础上,将已知的奇异值阈值(SVT)扩展到张量情况,并结合Tucker分解优化算法的性能。基于互联网流量数据,我们建立了两个不同的张量模型,并应用我们的TSVT来推断流量的未观测数据。此外,我们将TSVT算法应用于我们的互联网数据。在综合数据上的数值实验验证了该方法的有效性,在DPI交通数据上的应用也证明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信