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
Fast indexing strategies for robust image hashes
TL;DR: This work presents and evaluates two indexing strategies for robust image hashes created by the ForBild tool, based on generic indexing approaches for Hamming spaces, i.e. spaces of bit vectors equipped with the Hamming distance.
Fuzzy Extractors and Cryptography, or How to Use Your Fingerprints
TL;DR: This work proposes two primitives: a fuzzy extractor extracts nearly uniform randomness R from its biometric input; the extraction is error-tolerant in the sense that R will be the same even if the input changes, as long as it remains reasonably close to the original.
Proceedings ArticleDOI
A dictionary for approximate string search and longest prefix search
TL;DR: A dictionary data structure for string search with errors where the query string may didiffer from the expected matching string by a few edits is proposed and a simple reduction can be used to obtain similar results for approximate longest prefix search.
Journal ArticleDOI
Set similarity join on probabilistic data
Xiang Lian,Lei Chen +1 more
TL;DR: To efficiently process the PS2J operator, this paper first reduces the problem by condensing the possible worlds, and then proposes effective pruning techniques, including Jaccard distance pruned, probability upper bound pruning, and aggregate pruning that can filter out false alarms of probabilistic set pairs.
Journal ArticleDOI
Product review management software based on multiple classifiers
Cagatay Catal,Suat Guldan +1 more
TL;DR: A model using a multiple classifier system to identify deceptive negative customer reviews is proposed, validated with a dataset of hotel reviews from TripAdvisor and provided remarkable results that demonstrate improvement upon approaches reported in the literature.
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).