基于k均值聚类算法的电力数据分析方法

Qinyi Lei, Cong Hu, Dehua Hong, Cuiling Liu, Linyan Zhao, Qiu-Ju Sun
{"title":"基于k均值聚类算法的电力数据分析方法","authors":"Qinyi Lei, Cong Hu, Dehua Hong, Cuiling Liu, Linyan Zhao, Qiu-Ju Sun","doi":"10.1109/ITOEC53115.2022.9734317","DOIUrl":null,"url":null,"abstract":"With the rapid increase in the amount of grid data, more and more data needs to be backed up and restored in the data backup system. However, the similarity between each backup file exceeds 60%, and all storage on the hard disk is a waste of storage space, so it is proposed A DELTA compression method based on K-medoids clustering is used to remove duplicate data in backup data. By performing pairwise DELTA compression on the file blocks, the size of each compressed file is obtained as the similarity between the two file blocks. Through the obtained similarity, K-medoids clustering is performed as a preprocessing step before DELTA compression. Then, according to the clustering results of K-medoids, DELTA compression is performed after merging small file blocks. The test results show that this method can improve the compression rate and reduce the number of fingerprint searches in DELTA compression.","PeriodicalId":127300,"journal":{"name":"2022 IEEE 6th Information Technology and Mechatronics Engineering Conference (ITOEC)","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Electricity data analysis method based on K-means clustering algorithm\",\"authors\":\"Qinyi Lei, Cong Hu, Dehua Hong, Cuiling Liu, Linyan Zhao, Qiu-Ju Sun\",\"doi\":\"10.1109/ITOEC53115.2022.9734317\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the rapid increase in the amount of grid data, more and more data needs to be backed up and restored in the data backup system. However, the similarity between each backup file exceeds 60%, and all storage on the hard disk is a waste of storage space, so it is proposed A DELTA compression method based on K-medoids clustering is used to remove duplicate data in backup data. By performing pairwise DELTA compression on the file blocks, the size of each compressed file is obtained as the similarity between the two file blocks. Through the obtained similarity, K-medoids clustering is performed as a preprocessing step before DELTA compression. Then, according to the clustering results of K-medoids, DELTA compression is performed after merging small file blocks. The test results show that this method can improve the compression rate and reduce the number of fingerprint searches in DELTA compression.\",\"PeriodicalId\":127300,\"journal\":{\"name\":\"2022 IEEE 6th Information Technology and Mechatronics Engineering Conference (ITOEC)\",\"volume\":\"2015 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-03-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 6th Information Technology and Mechatronics Engineering Conference (ITOEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITOEC53115.2022.9734317\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 6th Information Technology and Mechatronics Engineering Conference (ITOEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITOEC53115.2022.9734317","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着网格数据量的快速增长,数据备份系统中需要备份和恢复的数据越来越多。但由于每个备份文件之间的相似性超过60%,硬盘上的所有存储都是对存储空间的浪费,因此提出了一种基于K-medoids聚类的DELTA压缩方法来去除备份数据中的重复数据。通过对文件块进行两两DELTA压缩,得到每个压缩文件的大小作为两个文件块之间的相似度。通过得到的相似度,进行k - medioids聚类,作为DELTA压缩前的预处理步骤。然后,根据K-medoids聚类结果,合并小文件块后进行DELTA压缩。实验结果表明,该方法在DELTA压缩中可以提高压缩率,减少指纹搜索次数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Electricity data analysis method based on K-means clustering algorithm
With the rapid increase in the amount of grid data, more and more data needs to be backed up and restored in the data backup system. However, the similarity between each backup file exceeds 60%, and all storage on the hard disk is a waste of storage space, so it is proposed A DELTA compression method based on K-medoids clustering is used to remove duplicate data in backup data. By performing pairwise DELTA compression on the file blocks, the size of each compressed file is obtained as the similarity between the two file blocks. Through the obtained similarity, K-medoids clustering is performed as a preprocessing step before DELTA compression. Then, according to the clustering results of K-medoids, DELTA compression is performed after merging small file blocks. The test results show that this method can improve the compression rate and reduce the number of fingerprint searches in DELTA compression.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信