All-Three: Near-optimal and domain-independent algorithms for near-duplicate detection

In this paper, we propose a general domain-independent approach called Merge-Filter Representative-based Clustering (Merge−Filter−RC) for detecting near-duplicate records within a single and across multiple data sources. Subsequently, we develop three near-optimal classes of algorithms: constant threshold (CT) variable threshold (VT) and function threshold (FT), which we collectively call All−Three algorithms. Merge−Filter−RC and All−Three mold the basis of this work. Merge−Filter−RC works recursively in the spirit of divide-merge fashion for distilling locally and globally near-duplicates as hierarchical clusters along with their prototype representatives. Each cluster is characterized by one or more representatives which are in turn refined dynamically. Representatives are used for further similarity comparisons to reduce the number of pairwise comparisons and consequently the search space. In addition, we segregate the results of the comparisons by labels which we refer to as very similar, similar, or not similar. We complement All−Three algorithms by a more thorough reexamination of the original well-tuned features of the seminal work of Monge-Elkan's (ME) algorithm which we circumvented by an affine variant of the Smith-Waterman's (SW) similarity measure.Using both real-world benchmarks and synthetically generated data sets, we performed several experiments and extensive analysis to show that All−Three algorithms which are rooted in the Merge−Filter−RC approach significantly outperform Monge-Elkan's algorithm in terms of accuracy in detecting near-duplicates. In addition, All−Three algorithms are as efficient in terms of computations as Monge-Elkan's algorithm.

Abstract licence: CC BY-NC

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.