文章基本信息

标题：Towards Syntactic Approximate Matching - A Pre-Processing Experiment
本地全文：下载
作者：Jeong, Doowon ; Breitinger, Frank ; Kang, Hari 等
期刊名称：Journal of Digital Forensics, Security and Law
印刷版ISSN：1558-7215
电子版ISSN：1558-7223
出版年度：2016
卷号：11
期号：2
页码：6
出版社：Association of Digital Forensics, Security and Law
摘要：Over the past few years the popularity of approximate matching algorithms (a.k.a. fuzzy hashing) has increased. Especially within the area of bytewise approximate matching, several algorithms were published, tested and improved. It has been shown that these algorithms are powerful, however they are sometimes too precise for real world investigations. That is, even very small commonalities (e.g., in the header of a le) can cause a match. While this is a desired property, it may also lead to unwanted results. In this paper we show that by using simple pre-processing, we signicantly can in uence the outcome. Although our test set is based on text-based le types (cause of an easy processing), this technique can be used for other, well-documented types as well. Our results show, that it can be benecial to focus on the content of les only (depending on the use-case). While for this experiment we utilized text les, Additionally, we present a small, self-created dataset that can be used in the future for approximate matching algorithms since it is labeled (we know which les are similar and how).
关键词：Bytewise Approximate Matching; Pre-processing; Syntactic Similarity; Digital forensics