Abstract
Easy access to the World Wide Web has raised concerns about copyright issues and plagiarism. It is easy to copy someone else’s work and submit it as someone’s own. This problem has been targeted by many systems, which use very similar approaches. These approaches are compared in this paper and suggestions are made when different strategies are more applicable than others. Some alternative approaches are proposed that perform better than previously presented methods. These previous methods share two common stages: chunking of documents and selection of representative chunks. We study both stages and also propose alternatives that are better in terms of accuracy and space requirement. The applications of these methods are not limited to plagiarism detection but may target other copy-detection problems. We also propose a third stage to be applied in the comparison that uses suffix trees and suffix vectors to identify the overlapping chunks.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full chapter text
Chapter PDF
References
Argetsinger A. Technology exposes cheating at U-Va. The Washington Post, May 8, 2001.
Benjaminson A. Internet offers new path to plagiarism, UC-Berkeley officials say. Daily Californian, October 6, 1999.
Broder A.Z., Glassman S.C., Manasse M.S. Syntatic Clustering of the Web. Sixth International Web Conference, Santa Clara, California USA. URL http://decweb.ethz.ch/WWW6/Technical/Paper205/paper205.html
EVE Plagiarism Detection System. URL http://www.canexus.com , 2000
Garcia-Molina H., Shivakumar N. The SCAM Approach To Copy Detection in Digital Libraries. D-lib Magazine, November, 1995.
Garcia-Molina H., Shivakumar N. Building a Scalable and Accurate Copy Detection Mechanism. Proceedings of 1st ACM International Conference on Digital Libraries (DL’96) March, Bethesda Maryland, 1996.
Heintze N. Scalable Document Fingerprinting. Proceedings of the Second USENIX Workshop on Electronic Commerce, Oakland, California, 18–21 November, 1996. URL http://www.cs.cmu.edu/afs/cs/user/nch/www/koala/main.html
Monostori K., Zaslavsky A., Schmidt H. MatchDetectReveal: Finding Overlapping and Similar Digital Documents. Information Resources Management Association International Conference (IRMA2000), 21-24 May, 2000 at Anchorage Hilton Hotel, Anchorage, Alaska, USA. pp 955-957, 2000.
Monostori K., Zaslavsky A., Schmidt H. Parallel Overlap and Similarity Detection in Semi-Structured Document Collections. Proceedings of 6th Annual Australasian Conference on Parallel And Real-Time Systems (PART’ 99), Melbourne, Australia, 1999. pp 92–103, 1999.
Plagiarism.org, the Internet plagiarism detection service for authors & education. URL http://www.plagiarism.org , 1999.
Rivest R. L.. RFC 1321: The MD5 Message-Digest Algorithm. Internet Activities Board, April 1992.
Wall L. and Schwartz R. L. Programming Perl. O’Reilly & Associates, Inc., 981 Chestnut Street, Newton, MA 02164, USA, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Monostori, K., Finkel, R., Zaslavsky, A., Hodász, G., Pataki, M. (2002). Comparison of Overlap Detection Techniques. In: Sloot, P.M.A., Hoekstra, A.G., Tan, C.J.K., Dongarra, J.J. (eds) Computational Science — ICCS 2002. ICCS 2002. Lecture Notes in Computer Science, vol 2329. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46043-8_4
Download citation
DOI: https://doi.org/10.1007/3-540-46043-8_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43591-4
Online ISBN: 978-3-540-46043-5
eBook Packages: Springer Book Archive