The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Efficient similarity joins for near-duplicate detection
Abstract
With the increasing amount of data and the need to integrate data from multiple data sources, one of the challenging issues is to identify near-duplicate records efficiently. In this article, we focus on efficient algorithms to find a pair of records such that their similarities are no less than 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 token ordering information; they are integrated into the existing methods and drastically reduce the candidate sizes and hence improve the efficiency. We have also studied the implementation of our proposed algorithm in stand-alone and RDBMS-based settings. Experimental results show our proposed algorithms can outperform previous algorithms on several real datasets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Baeza-Yates, R. A., & Ribeiro-Neto, B. A. (1999) · Cited by 11,505
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
(1999) · Cited by 3,186
A guided tour to approximate string matching
Navarro, G. (2001) · ACM Computing Surveys · doi:10.1145/375360.375365 · Cited by 2,561
Similarity estimation techniques from rounding algorithms
Charikar, M. S. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.509965 · Cited by 2,220
On the resemblance and containment of documents
Broder, A. Z. (2002) · Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171) · doi:10.1109/sequen.1997.666900 · Cited by 1,698
Syntactic clustering of the Web
Broder, A. Z., Glassman, S. C., Manasse, M. S., & Zweig, G. (1997) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(97)00031-7 · Cited by 1,343
Schleimer, S., S, W. D., & Aiken, A. (2003) · Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data · doi:10.1145/872757.872770 · Cited by 1,099
Optimal aggregation algorithms for middleware
Fagin, R., Lotem, A., & Naor, M. (2003) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(03)00026-6 · Cited by 942
Real-world Data is Dirty: Data Cleansing and The Merge/Purge Problem
Hernández, M. A., & Stolfo, S. J. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009761603038 · Cited by 812
The State of Record Linkage and Current Research Problems
Winkler, W. E. (1999) · Cited by 810
Interactive deduplication using active learning
Sarawagi, S., & Bhamidipaty, A. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775087 · Cited by 692
Scaling up all pairs similarity search
Bayardo, R. J., Ma, Y., & Srikant, R. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242591 · Cited by 673
Detecting near-duplicates for web crawling
Manku, G. S., Jain, A., & Das Sarma, A. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242592 · Cited by 617
Finding similar files in a large file system
Manber, U. (1994) · Cited by 594
Copy detection mechanisms for digital documents
Brin, S., Davis, J., & García-Molina, H. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223855 · Cited by 479
Adaptive name matching in information integration
Bilenko, M., Mooney, R., Cohen, W., Ravikumar, P., & Fienberg, S. (2003) · IEEE Intelligent Systems · doi:10.1109/mis.2003.1234765 · Cited by 469
Robust and efficient fuzzy match for online data cleaning
Chaudhuri, S., Ganjam, K., Ganti, V., & Motwani, R. (2003) · Proceedings of the 2003 ACM SIGMOD international conference on Management of data · doi:10.1145/872757.872796 · Cited by 457
Efficient similarity joins for near duplicate detection
Xiao, C., Wang, W., Lin, X., & Yu, J. X. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367516 · Cited by 455
Self-citationFinding near-duplicate web pages: a large-scale evaluation of algorithms
Henzinger, M. (2006) · Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1148170.1148222 · Cited by 421
Efficient exact set-similarity joins
Arasu, A., Ganti, V., & Kaushik, R. (2006) · doi:10.5555/1182635.1164206 · Cited by 406
Efficient similarity search and classification via rank aggregation
Fagin, R., Kumar, R., & Sivakumar, D. (2003) · Proceedings of the 2003 ACM SIGMOD international conference on Management of data · doi:10.1145/872757.872795 · Cited by 362
Methods for identifying versioned and plagiarized documents
Hoad, T. C., & Zobel, J. (2003) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.10170 · Cited by 330
Evaluating similarity measures: a large-scale study in the orkut social network
Spertus, E., Sahami, M., & Buyukkokten, O. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081956 · Cited by 296
Collection statistics for fast duplicate document detection
Chowdhury, A., Frieder, O., Grossman, D., & McCabe, M. C. (2002) · ACM Transactions on Information Systems · doi:10.1145/506309.506311 · Cited by 251
Li, C., Wang, B., & Yang, X. (2007) · Cited by 182
Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology
Holmes, S. P., & Gusfield, D. (1999) · Journal of the American Statistical Association · doi:10.2307/2670026 · Cited by 177
Theobald, M., Siddharth, J., & Paepcke, A. (2008) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1390334.1390431 · Cited by 155
On the evolution of clusters of near-duplicate Web pages
Fetterly, D., Manasse, M. S., & Najork, M. (2004) · doi:10.1109/laweb.2003.1250280 · Cited by 153
Finding replicated Web collections
Cho, J. J., Shivakumar, N., & García-Molina, H. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335429 · Cited by 142
On approximate string matching
Ukkonen, E. (1983) · Lecture notes in computer science · doi:10.1007/3-540-12689-9_129 · Cited by 136
Seo, J., & Croft, W. B. (2008) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1390334.1390432 · Cited by 96
Yang, X., Wang, B., & Li, C. (2008) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1376616.1376655 · Cited by 90
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Behm, A., Ji, S., Li, C., & Lu, J. (2009) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2009.32 · Cited by 73
Online duplicate document detection
Conrad, J. G., Guo, X. S., & Schriber, C. P. (2003) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/956863.956946 · Cited by 72
Finding replicated Web collections
Cho, J. J., Shivakumar, N., & García-Molina, H. (2000) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/342009.335429 · Cited by 62
Detecting the origin of text segments efficiently
Hamid, O. A., Behzadi, B., Christoph, S., et al. (2009) · International World Wide Web Conference (WWW) · doi:10.1145/1526709.1526719 · Cited by 41
(1997)
Cited by
CrowdER: crowdsourcing entity resolution
Wang, J., Kraska, T., Franklin, M. J., & Feng, J. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2350229.2350263 · Cited by 507
Constructing an interactive natural language interface for relational databases
Li, F., & Jagadish, H. V. (2014) · Proceedings of the VLDB Endowment · doi:10.14778/2735461.2735468 · Cited by 437
Deep learning approaches for similarity computation: A survey
Yang, P., Wang, H., Yang, J., Qian, Z., Zhang, Y., & Lin, X. (2024) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2024.3422484 · Cited by 28
Self-citation
Metadata
- Authors
- Xiao, C., Wang, W., Lin, X., Yu, J. X., & Wang, G.
- Venue
- ACM Transactions on Database Systems
- Published
- 2011-08
- Volume
- 36
- Issue
- 3
- Pages
- 1-41
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W2065259291
- Cited by
- 331
- References
- 38
- FWCI
- 28.61
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.