Dimensionality Reduction of Massive I/O Log Data Flow in Power System

Bo Zhang, Zesheng Xi, T. Zhang, Yuanyuan Ma, Zhipeng Shao, Hongfa Li
{"title":"Dimensionality Reduction of Massive I/O Log Data Flow in Power System","authors":"Bo Zhang, Zesheng Xi, T. Zhang, Yuanyuan Ma, Zhipeng Shao, Hongfa Li","doi":"10.1109/CISCE50729.2020.00045","DOIUrl":null,"url":null,"abstract":"Every day, the power system receives massive I/O logs. The amount of data in these logs is so large that it takes huge computational resources to analyze. Therefore, it is necessary to reduce the size of the massive I/O logs and only analyze the key log data, thereby reducing the workload of invalid analysis. This paper takes the I/O log of the substation as the research object, and studies the dimension reduction method of the massive I/O data flow log, which reduces the computational load brought by the high-dimensional I/O data flow log data and reduces the massive I/O data flow log. This paper proposes a method of secondary dimensionality reduction. Firstly, the high dimensional I/O log data stream is classified, so that the data is transformed from high-dimensional to low-dimensional. Then, the dimension is reduced again in each category, so that the most simplified massive I/O logs are achieved. Through theoretical analysis, we can come to the conclusion that the computational time complexity of the data after dimension reduction is reduced by more than 80%.","PeriodicalId":101777,"journal":{"name":"2020 International Conference on Communications, Information System and Computer Engineering (CISCE)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Communications, Information System and Computer Engineering (CISCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISCE50729.2020.00045","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Every day, the power system receives massive I/O logs. The amount of data in these logs is so large that it takes huge computational resources to analyze. Therefore, it is necessary to reduce the size of the massive I/O logs and only analyze the key log data, thereby reducing the workload of invalid analysis. This paper takes the I/O log of the substation as the research object, and studies the dimension reduction method of the massive I/O data flow log, which reduces the computational load brought by the high-dimensional I/O data flow log data and reduces the massive I/O data flow log. This paper proposes a method of secondary dimensionality reduction. Firstly, the high dimensional I/O log data stream is classified, so that the data is transformed from high-dimensional to low-dimensional. Then, the dimension is reduced again in each category, so that the most simplified massive I/O logs are achieved. Through theoretical analysis, we can come to the conclusion that the computational time complexity of the data after dimension reduction is reduced by more than 80%.
电力系统海量I/O日志数据流降维研究
每天,电力系统都会接收到大量的I/O日志。这些日志中的数据量非常大,需要大量的计算资源来分析。因此,有必要减少大量I/O日志的大小,只分析关键的日志数据,从而减少无效分析的工作量。本文以变电站的I/O日志为研究对象,研究了海量I/O数据流日志的降维方法,减少了高维I/O数据流日志数据带来的计算负荷,减少了海量I/O数据流日志。提出了一种二次降维方法。首先对高维I/O日志数据流进行分类,实现数据从高维到低维的转换;然后,在每个类别中再次降低维度,从而实现最简化的海量I/O日志。通过理论分析,我们可以得出降维后数据的计算时间复杂度降低80%以上的结论。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信