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
Journal ArticleDOI
A novel Arabic OCR post-processing using rule-based and word context techniques
TL;DR: This paper provides a statistical Arabic language model and post-processing techniques based on hybridizing the error model approach with the context approach and shows that the proposed hybrid system outperforms the rule-based system.
Journal ArticleDOI
Locality-Sensitive Hashing Techniques for Nearest Neighbor Search
TL;DR: The notion of locality- sensitive hashing is introduced and the locality-sensitive hashing techniques are surveyed, categories them based on several criteria, presents their characteristics, and compares their performance.
Proceedings ArticleDOI
Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring
TL;DR: The experimental results demonstrate that LCCS-LSH outperforms state-of-the-art LSH schemes and is proposed as a novel LSH scheme based on the Longest Circular Co-Substring (LCCS) search framework with a theoretical guarantee.
Journal ArticleDOI
Asymmetric signature schemes for efficient exact edit similarity query processing
TL;DR: This article shows that for any signature scheme, the lower bound of the minimum number of signatures is τ + 1, which is lower than what is achieved by existing methods, and proposes several asymmetric signature schemes, that is, extracting different numbers of signatures for the data and query strings, which achieve this lower bound.
Journal ArticleDOI
Palmprint template protection scheme based on randomized cuckoo hashing and MinHash
TL;DR: A novel template protection method for generating cancelable palmprint features based on randomized cuckoo hashing and minHash and another layer of privacy protection, MinHash is adopted to improve the efficiency and resist unlinkability attacks.
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).