Online duplicate document detection: signature reliability in a dynamic retrieval environment

As online document collections continue to expand, both on the Web and in proprietary environments, the need for duplicate detection becomes more critical. Few users wish to retrieve search results consisting of sets of duplicate documents, whether identical duplicates or close matches. Our goal in this work is to investigate the phenomenon and determine one or more approaches that minimize its impact on search results. Recent work has focused on using some form of signature to characterize a document in order to reduce the complexity of document comparisons. A representative technique constructs a 'fingerprint' of the rarest or richest features in a document using collection statistics as criteria for feature selection. One of the challenges of this approach, however, arises from the fact that in production environments, collections of documents are always changing, with new documents, or new versions of documents, arriving frequently, and other documents periodically removed. When an enterprise proceeds to freeze a training collection in order to stabilize the underlying repository of such features and its associated collection statistics, issues of coverage and completeness arise. We show that even with very large training collections possessing extremely high feature correlations before and after updates, underlying fingerprints remain sensitive to subtle changes. We explore alternative solutions that benefit from the development of massive meta-collections made up of sizable components from multiple domains. This technique appears to offer a practical foundation for fingerprint stability. We also consider mechanisms for updating training collections while mitigating signature instability. Our research is divided into three parts. We begin with a study of the distribution of duplicate types in two broad-ranging news collections consisting of approximately 50 million documents. We then examine the utility of document signatures in addressing identical or nearly identical duplicate documents and their sensitivity to collection updates. Finally, we investigate a flexible method of characterizing and comparing documents in order to permit the identification of non-identical duplicates. This method has produced promising results following an extensive evaluation using a production-based test collection created by domain experts.

[1]  C. A. Moser,et al.  Facts from Figures. , 1953 .

[2]  T. Asfour,et al.  Facts & Figures , 1962, Contemporary Canadian Picture Books.

[3]  William H. Press,et al.  Numerical recipes in C. The art of scientific computing , 1987 .

[4]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[5]  W. Bruce Croft,et al.  Inference networks for document retrieval , 1989, SIGIR '90.

[6]  Carmen Miller Detecting duplicates: a searcher's dream come true , 1990 .

[7]  Howard R. Turtle Natural language vs. Boolean query evaluation: a comparison of retrieval performance , 1994, SIGIR '94.

[8]  Paul Thompson,et al.  TREC-3 Ad Hoc Retrieval and Routing Experiments using the WIN System , 1994, TREC.

[9]  Udi Manber,et al.  Finding Similar Files in a Large File System , 1994, USENIX Winter.

[10]  Hector Garcia-Molina,et al.  Copy detection mechanisms for digital documents , 1995, SIGMOD '95.

[11]  Carol Tenopir,et al.  TARGET and FREESTYLE: DIALOG and Mead join the relevance ranks , 1997 .

[12]  Donna K. Harman,et al.  Overview of the Sixth Text REtrieval Conference (TREC-6) , 1997, Inf. Process. Manag..

[13]  Geoffrey Zweig,et al.  Syntactic Clustering of the Web , 1997, Comput. Networks.

[14]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[15]  Hector Garcia-Molina,et al.  Finding Near-Replicas of Documents and Servers on the Web , 1998, WebDB.

[16]  Hector Garcia-Molina,et al.  Finding near-replicas of documents on the Web , 1999 .

[17]  Robert Wilensky,et al.  Robust Hyperlinks: Cheap, Everywhere, Now , 2000, DDEP/PODDP.

[18]  Ophir Frieder,et al.  Efficiency Considerations for Scalable Information Retrieval Servers , 2006, J. Digit. Inf..

[19]  James P. Callan,et al.  Query-based sampling of text databases , 2001, TOIS.

[20]  James W. Cooper,et al.  Detecting similar documents using salient terms , 2002, CIKM '02.

[21]  David M. Pennock,et al.  Analysis of lexical signatures for finding lost or related documents , 2002, SIGIR '02.

[22]  William H. Press,et al.  Numerical recipes in C , 2002 .

[23]  Ophir Frieder,et al.  Collection statistics for fast duplicate document detection , 2002, TOIS.