Efficient similarity joins for near duplicate detection

With the increasing amount of data and the need to integrate data from multiple data sources, a challenging issue is to find near duplicate records efficiently. In this paper, we focus on efficient algorithms to find pairs of records such that their similarities are above a given threshold. Several existing algorithms rely on the prefix filtering principle to avoid computing similarity values for all possible pairs of records. We propose new filtering techniques by exploiting the ordering information; they are integrated into the existing methods and drastically reduce the candidate sizes and hence improve the efficiency. Experimental results show that our proposed algorithms can achieve up to 2.6x?5x speed-up over previous algorithms on several real datasets and provide alternative solutions to the near duplicate Web page detection problem. Categories and Subject Descriptors: H.3.3 [Information Search and Retrieval]: Search Process, Clustering General Terms: Algorithms, Performance

• Type: Conference
• Year: 2008
• Where: WWW
• Authors: Chuan Xiao, Wei Wang 0011, Xuemin Lin, Jeffrey Xu Yu
• Keywords: Efficient Algorithms, Internet Technology, Prefix Filtering Principle, Several Existing Algorithms, WWW 2008