Abstract

Given two documents A and B we define two mathematical notions: their resemblance r(A, B)andtheircontainment 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.

Citations

1478	The probabilistic method - ALON, SPENCER - 2008
346	Syntactic clustering of the web - Broder, Glassman, et al. - 1997
176	Finding Similar Files in a Large File System - Manber - 1994
175	Fingerprinting by random polynomials - Rabin - 1981
151	Min-wise Independent Permutations - Broder, Charikar, et al. - 1998
138	Copy detection mechanisms for digital documents - Brin, Davis, et al. - 1995
91	SCAM: A Copy Detection Mechanism for Digital Documents," D-Lib Magazine - Shivakumar, Garcia-Molina - 1995
68	Some Applications of Rabin’s Fingerprinting Method - Broder - 1993
59	Scalable document fingerprinting - Heintze - 1996
59	Building a Scalable and Accurate Copy Detection Mechanism - Shivakumar, Garcia-Molina - 1996