The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Methods for identifying versioned and plagiarized documents
Abstract
The widespread use of on‐line publishing of text promotes storage of multiple versions of documents and mirroring of documents in multiple locations, and greatly simplifies the task of plagiarizing the work of others. We evaluate two families of methods for searching a collection to find documents that are coderivative, that is, are versions or plagiarisms of each other. The first, the ranking family, uses information retrieval techniques; extending this family, we propose the identity measure, which is specifically designed for identification of coderivative documents. The second, the fingerprinting family, uses hashing to generate a compact document description, which can then be compared to the fingerprints of the documents in the collection. We introduce a new method for evaluating the effectiveness of these techniques, and demonstrate it in practice. Using experiments on two collections, we demonstrate that the identity measure and the best fingerprinting technique are both able to accurately identify coderivative documents. However, for fingerprinting parameters must be carefully chosen, and even so the identity measure is clearly superior.
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
Cites
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
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Witten, I. H., Moffat, A., & Bell, T. (1999) · Morgan Kaufmann Publishers Inc. eBooks · Cited by 705
Finding similar files in a large file system
Manber, U. (1994) · Cited by 594
How reliable are the results of large-scale information retrieval experiments?
Zobel, J. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.291014 · Cited by 579 · cited 1×
“tems [19]; however, they are not well-suited to this task.”
BackgroundSelf-citationCopy 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
Exploring the similarity space
Zobel, J., & Moffat, A. (1998) · ACM SIGIR Forum · doi:10.1145/281250.281256 · Cited by 378
Self-citationSelf-indexing inverted files for fast text retrieval
Moffat, A., & Zobel, J. (1996) · ACM Transactions on Information Systems · doi:10.1145/237496.237497 · Cited by 361
Self-citationOverview of the Second Text Retrieval Conference (TREC-2)
Harman, D. (1995) · Information Processing & Management · doi:10.1016/0306-4573(94)00047-7 · Cited by 306
(1995) · Cited by 296
YAP3: improved detection of similarities in computer program and other texts
Wise, M. J. (1996) · Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education · doi:10.1145/236452.236525 · Cited by 294
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
Building a scalable and accurate copy detection mechanism
Shivakumar, N., & Garcia-Molina, H. (1996) · Proceedings of the first ACM international conference on Digital libraries - DL '96 · doi:10.1145/226931.226961 · Cited by 160
YAP3: improved detection of similarities in computer program and other texts
Wise, M. J. (1996) · ACM SIGCSE Bulletin · doi:10.1145/236462.236525 · Cited by 123
Finding Near-Replicas of Documents on the Web
Shivakumar, N., & García-Molina, H. (1999) · Lecture notes in computer science · doi:10.1007/10704656_13 · Cited by 99
Finding Near-Replicas of Documents and Servers on the Web
Shivakumar, N., & García-Molina, H. (1998) · International Workshop on the Web and Databases · Cited by 88
Detection of similarities in student programs
Wise, M. J. (1992) · ACM Technical Symposium on Computer Science Education (SIGCSE) · doi:10.1145/134510.134564 · Cited by 88
Performance in Practice of String Hashing Functions
Ramakrishna, M. V., & Zobel, J. (1997) · Database Systems for Advanced Applications · doi:10.1142/9789812819536_0023 · Cited by 81
Self-citationDocument overlap detection system for distributed digital libraries
Monostori, K., Zaslavsky, A., & Schmidt, H. W. (2000) · doi:10.1145/336597.336667 · Cited by 48
Detection of similarities in student programs
Wise, M. J. (1992) · ACM SIGCSE Bulletin · doi:10.1145/135250.134564 · Cited by 28
Cited by
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
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
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
Efficient similarity joins for near-duplicate detection
Xiao, C., Wang, W., Lin, X., Yu, J. X., & Wang, G. (2011) · ACM Transactions on Database Systems · doi:10.1145/2000824.2000825 · Cited by 331
Detecting Phishing Web Pages with Visual Similarity Assessment Based on Earth Mover's Distance (EMD)
Fu, A. Y., Wenyin, L., & Deng, X. (2006) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2006.50 · Cited by 294
Metadata
- Authors
- Hoad, T. C., & Zobel, J.
- Venue
- Journal of the American Society for Information Science and Technology
- Publisher
- Wiley
- Published
- 2003-01-16
- Volume
- 54
- Issue
- 3
- Pages
- 203-215
- ISSN
- 1532-2882 (ISSN-L)
- 1532-2890
- OpenAlex
- W2164634022
- Cited by
- 330
- References
- 19
- FWCI
- 38.64
- 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.