scispace - formally typeset
Proceedings ArticleDOI

On the resemblance and containment of documents

Andrei Z. Broder
- 11 Jun 1997 - 
- pp 21-29
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

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Tracking Web spam with HTML style similarities

TL;DR: This work study and compare several HTML style similarity measures based on both textual and extra-textual features in HTML source code and proposes a flexible algorithm to cluster a large collection of documents according to these measures.
Patent

Delta compression after identity deduplication

TL;DR: In this article, the identity deduplication is disclosed and a first data segment is determined to be identical to a first previous data segment, and a second data segment was determined not to be similar to a third previous segment.

Consistent Weighted Sampling

TL;DR: An ecient procedure for sampling representatives from a weighted set such that for any weightings S and T, the probability that the two choose the same sample is the Jacard similarity.
Proceedings ArticleDOI

Approximate Nearest Neighbor Search in High Dimensions

TL;DR: This article surveys the developments of the nearest neighbor problem, which has a wide range of applications in machine learning, computer vision, databases and other fields, as well as their connections to questions in geometric functional analysis and combinatorial geometry.
Journal ArticleDOI

An improved plagiarism detection scheme based on semantic role labeling

TL;DR: The method significantly outperforms the modern methods for plagiarism detection in terms of Recall, Precision and F-measure and weighting for each argument generated by SRL to study its behaviour is introduced.
References
More filters
Book

The Probabilistic Method

Joel Spencer
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).