Proceedings ArticleDOI
On the resemblance and containment of documents
TLDR
The basic idea is to reduce these issues to set intersection problems that can be easily evaluated by a process of random sampling that could be done independently for each document.Abstract:
Given two documents A and B we define two mathematical notions: their resemblance r(A, B) and their containment c(A, B) that seem to capture well the informal notions of "roughly the same" and "roughly contained." The basic idea is to reduce these issues to set intersection problems that can be easily evaluated by a process of random sampling that can be done independently for each document. Furthermore, the resemblance can be evaluated using a fixed size sample for each document. This paper discusses the mathematical properties of these measures and the efficient implementation of the sampling process using Rabin (1981) fingerprints.read more
Citations
More filters
Proceedings ArticleDOI
Scalable Facility Location for Massive Graphs on Pregel-like Systems
TL;DR: In this article, the authors proposed a scalable algorithm for the facility location problem in the graph setting, where the cost of serving a client from a facility is represented by the shortest-path distance on a graph.
Book ChapterDOI
How should we solve search problems privately
TL;DR: This work aims for stronger definitions of privacy for search problems that provide reasonable privacy, and gives two alternative definitions and discusses their privacy guarantees.
Dissertation
The use of Levenshtein distance in computer forensics
TL;DR: An alternative way to process large amounts of raw data is suggested, with the use of an approximate search algorithm to help focusing on interesting areas of a digital media.
Journal ArticleDOI
AIDIS: Detecting and classifying anomalous behavior in ubiquitous kernel processes
TL;DR: This article proposes AIDIS, an Advanced Intrusion Detection and Interpretation System capable to explain anomalous behavior within a network-enabled user session by considering kernel event anomalies identified through their deviation from a set of baseline process graphs.
Posted Content
Very Sparse Stable Random Projections, Estimators and Tail Bounds for Stable Random Projections
TL;DR: This paper proposes to significantly reduce the processing and storage cost of stable random projections, and provides an improved estimator for recovering the original $l_\alpha$ norms from the projected data.
References
More filters
Book
The Probabilistic Method
TL;DR: A particular set of problems - all dealing with “good” colorings of an underlying set of points relative to a given family of sets - is explored.
Journal ArticleDOI
Syntactic clustering of the Web
TL;DR: An efficient way to determine the syntactic similarity of files is developed and applied to every document on the World Wide Web, and a clustering of all the documents that are syntactically similar is built.
Journal ArticleDOI
Min-Wise Independent Permutations
TL;DR: This research was motivated by the fact that such a family of permutations is essential to the algorithm used in practice by the AltaVista web index software to detect and filter near-duplicate documents.
Proceedings Article
Finding similar files in a large file system
TL;DR: Application of sif can be found in file management, information collecting, program reuse, file synchronization, data compression, and maybe even plagiarism detection.
Proceedings ArticleDOI
Copy detection mechanisms for digital documents
TL;DR: This paper proposes a system for registering documents and then detecting copies, either complete copies or partial copies, and describes algorithms for such detection, and metrics required for evaluating detection mechanisms (covering accuracy, efficiency, and security).