The DOI matches its Crossref record.
Building a scalable and accurate copy detection mechanism
Open accessAbstract
Often, publishers are reluctant to offer valuable digital documents on the Internet for fear that they will be re-transmitted or copied widely. A Copy Detection Mechanism can help identify such copying. For example, publishers may register their documents with a copy detection server, and the server can then automatically check public sources such as UseNet articles and Web sites for potential illegal copies. The server can search for exact copies, and also for cases where significant portions of documents have been copied. In this paper we study, for the first time, the performance of various copy detection mechanisms, including the disk storage requirements, main memory requirements, response times for registration, and response time for querying. We also contrast performance to the accuracy of the mechanisms (how well they detect partial copies). The results are obtained using SCAM, an experimental server we have implemented, and a collection of 50,000 netnews articles.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
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
Agglomerative clustering of a search engine query log
Beeferman, D., & Berger, A. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347176 · Cited by 768
Finding 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
Identifying and Filtering Near-Duplicate Documents
Broder, A. Z. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45123-4_1 · Cited by 395
LSH forest: self-tuning indexes for similarity search
Bawa, M., Condie, T., & Ganesan, P. (2005) · Proceedings of the 14th international conference on World Wide Web - WWW '05 · doi:10.1145/1060745.1060840 · Cited by 353
Finding interesting associations without support pruning
Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., Motwani, R., Ullman, J. D., & Yang, C. (2001) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.908981 · Cited by 341
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
State-of-the-art in detecting academic plagiarism
Meuschke, N., & Gipp, B. (2013) · International Journal for Educational Integrity · doi:10.21913/ijei.v9i1.847 · Cited by 112
Multilayer SOM With Tree-Structured Data for Efficient Document Retrieval and Plagiarism Detection
Chow, T. W. S., & Rahman, M. K. M. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2009.2023394 · Cited by 67
Near Similarity Search and Plagiarism Analysis
Stein, B., & zu Eissen, S. M. (2006) · Studies in Classification, Data Analysis, and Knowledge Organization · doi:10.1007/3-540-31314-1_52 · Cited by 62
A coarse-to-fine framework to efficiently thwart plagiarism
Zhang, H., & Chow, T. W. S. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2010.08.023 · Cited by 31
Metadata
- Authors
- Shivakumar, N., & Garcia-Molina, H.
- Venue
- Proceedings of the first ACM international conference on Digital libraries - DL '96
- Publisher
- ACM Press
- Published
- 1996
- Pages
- 160-168
- OpenAlex
- W1997657677
- Cited by
- 160
- References
- 0
- FWCI
- 59.76
- Type
- conference paper
- Language
- en
- Open access
- gold
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.