基于稀疏奇异值分解的缺失交通重构改进OMP

I. D. Irawati, A. B. Suksmono, Ian Joseph Matheus Edward
{"title":"基于稀疏奇异值分解的缺失交通重构改进OMP","authors":"I. D. Irawati, A. B. Suksmono, Ian Joseph Matheus Edward","doi":"10.1109/ICT.2019.8798801","DOIUrl":null,"url":null,"abstract":"Missing large amount of internet data is a crucial issue to be addressed in network monitoring. The missing information should be restored using only a minimum knowledge of the data. Compressive Sampling (CS) algorithm provides a solution to complete data by utilizing the properties of randomness in the input data. Recently the reconstruction algorithm has developed in the base dictionary using orthogonal based operators. In this paper, we consider a CS approch to solve the missing problem using Singular Value Decomposition (SVD) sparsity, routing matrix for measurement matrix, and Orthogonal Matching Pursuit (OMP) as a recovery algorithm. To improve the accuracy, we also incorporating linear interpolation after OMP and Bilinear interpolation after SVD reconstruction. The missing scheme is randomized to simulate the actual behaviour of the network. Our experiments show that our proposed method is capable to fix large missing values with a high degree of accuracy for all missing type. This method is superior compared to the method in previous studies.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Enhanced OMP for Missing Traffic Reconstruction based on Sparse SVD\",\"authors\":\"I. D. Irawati, A. B. Suksmono, Ian Joseph Matheus Edward\",\"doi\":\"10.1109/ICT.2019.8798801\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Missing large amount of internet data is a crucial issue to be addressed in network monitoring. The missing information should be restored using only a minimum knowledge of the data. Compressive Sampling (CS) algorithm provides a solution to complete data by utilizing the properties of randomness in the input data. Recently the reconstruction algorithm has developed in the base dictionary using orthogonal based operators. In this paper, we consider a CS approch to solve the missing problem using Singular Value Decomposition (SVD) sparsity, routing matrix for measurement matrix, and Orthogonal Matching Pursuit (OMP) as a recovery algorithm. To improve the accuracy, we also incorporating linear interpolation after OMP and Bilinear interpolation after SVD reconstruction. The missing scheme is randomized to simulate the actual behaviour of the network. Our experiments show that our proposed method is capable to fix large missing values with a high degree of accuracy for all missing type. This method is superior compared to the method in previous studies.\",\"PeriodicalId\":127412,\"journal\":{\"name\":\"2019 26th International Conference on Telecommunications (ICT)\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 26th International Conference on Telecommunications (ICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICT.2019.8798801\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 26th International Conference on Telecommunications (ICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICT.2019.8798801","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

大量网络数据的丢失是网络监控中需要解决的一个关键问题。丢失的信息应该只用最少的数据知识来恢复。压缩采样(CS)算法利用输入数据的随机性提供了一种完整数据的解决方案。近年来,基于正交算子的基字典重构算法得到了发展。在本文中,我们考虑了一种CS方法来解决缺失问题,使用奇异值分解(SVD)稀疏性,路由矩阵作为测量矩阵,正交匹配追踪(OMP)作为恢复算法。为了提高精度,我们还结合了OMP后的线性插值和SVD重建后的双线性插值。缺失的方案被随机化以模拟网络的实际行为。我们的实验表明,我们提出的方法能够以较高的精度修复所有缺失类型的大缺失值。与以往的研究方法相比,该方法具有明显的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Enhanced OMP for Missing Traffic Reconstruction based on Sparse SVD
Missing large amount of internet data is a crucial issue to be addressed in network monitoring. The missing information should be restored using only a minimum knowledge of the data. Compressive Sampling (CS) algorithm provides a solution to complete data by utilizing the properties of randomness in the input data. Recently the reconstruction algorithm has developed in the base dictionary using orthogonal based operators. In this paper, we consider a CS approch to solve the missing problem using Singular Value Decomposition (SVD) sparsity, routing matrix for measurement matrix, and Orthogonal Matching Pursuit (OMP) as a recovery algorithm. To improve the accuracy, we also incorporating linear interpolation after OMP and Bilinear interpolation after SVD reconstruction. The missing scheme is randomized to simulate the actual behaviour of the network. Our experiments show that our proposed method is capable to fix large missing values with a high degree of accuracy for all missing type. This method is superior compared to the method in previous studies.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信