Essential Characteristics of Approximate matching algorithms: A Survey of Practitioners Opinions and requirement regarding Approximate Matching

by   Monika Singh, et al.

Digital forensic investigation has become more challenging due to the rapid growth in the volume of encountered data. It is difficult for an investigator to examine the entire volume of encountered data manually. Approximate Matching algorithms are being used to serve the purpose by automatically filtering correlated and relevant data that an investigator needs to examine manually. Presently there are several prominent approximate matching tools and technique those are being used to assist critical investigation process. However, to measure the guarantees of a tool, it is important to understand the exact requirement of an investigator regarding these algorithms. This paper presents the findings of a closed survey conducted among a highly experienced group of federal state and local law enforcement practitioners and researchers, aimed to understand the practitioner and researcher's opinion regarding approximate matching algorithms. The study provides the baseline attributes of approximate matching tools that a scheme should possess to meet the real requirement of an investigator.



There are no comments yet.


page 1

page 2

page 3

page 4


A Feature Comparison of Modern Digital Forensic Imaging Software

Fundamental processes in digital forensic investigation, such as disk im...

Data Visualization Practitioners' Perspectives on Chartjunk

Chartjunk is a popular yet contentious topic. Previous studies have show...

Inexact Graph Matching Using Centrality Measures

Graph matching is the process of computing the similarity between two gr...

Linear Approximate Pattern Matching Algorithm

Pattern matching is a fundamental process in almost every scientific dom...

"Merging Results Is No Easy Task": An International Survey Study of Collaborative Data Analysis Practices Among UX Practitioners

Analysis is a key part of usability testing where UX practitioners seek ...

Self-Bounded Prediction Suffix Tree via Approximate String Matching

Prediction suffix trees (PST) provide an effective tool for sequence mod...

Aristotle Cloud Federation: Container Runtimes Technical Report

A National Science Foundation-sponsored container runtimes investigation...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.