基于数据压缩的文件相似性度量

Hubert Schölnast
{"title":"基于数据压缩的文件相似性度量","authors":"Hubert Schölnast","doi":"10.1109/DCC55655.2023.00063","DOIUrl":null,"url":null,"abstract":"The two meta-algorithms Concat Compress and Cross Compress, which can be used to measure the similarity of files, were subjected to an extensive practical test together with the compression algorithms Re-Pair, gzip and bz2:Five labeled datasets with 6533 entries and approximately 10 MB were subjected to a classification procedure using these algorithms. Theoretical considerations of the two meta-algorithms have been made in the past [1], but the practical implementation of these methods is still in its infancy. The results from our experiments are promising and show the great potential of this approach.","PeriodicalId":209029,"journal":{"name":"2023 Data Compression Conference (DCC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Measuring the Similarity of Files by Data Compression\",\"authors\":\"Hubert Schölnast\",\"doi\":\"10.1109/DCC55655.2023.00063\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The two meta-algorithms Concat Compress and Cross Compress, which can be used to measure the similarity of files, were subjected to an extensive practical test together with the compression algorithms Re-Pair, gzip and bz2:Five labeled datasets with 6533 entries and approximately 10 MB were subjected to a classification procedure using these algorithms. Theoretical considerations of the two meta-algorithms have been made in the past [1], but the practical implementation of these methods is still in its infancy. The results from our experiments are promising and show the great potential of this approach.\",\"PeriodicalId\":209029,\"journal\":{\"name\":\"2023 Data Compression Conference (DCC)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 Data Compression Conference (DCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC55655.2023.00063\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 Data Compression Conference (DCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC55655.2023.00063","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

两种元算法Concat Compress和Cross Compress可用于测量文件的相似性,并与压缩算法Re-Pair、gzip和bz2一起进行了广泛的实际测试:使用这些算法对5个带有6533个条目和大约10 MB的标记数据集进行了分类。这两种元算法的理论考虑已经在过去的b[1]中进行了,但这些方法的实际实现仍处于起步阶段。我们的实验结果很有希望,显示了这种方法的巨大潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Measuring the Similarity of Files by Data Compression
The two meta-algorithms Concat Compress and Cross Compress, which can be used to measure the similarity of files, were subjected to an extensive practical test together with the compression algorithms Re-Pair, gzip and bz2:Five labeled datasets with 6533 entries and approximately 10 MB were subjected to a classification procedure using these algorithms. Theoretical considerations of the two meta-algorithms have been made in the past [1], but the practical implementation of these methods is still in its infancy. The results from our experiments are promising and show the great potential of this approach.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信