Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Comparison of overlap detection techniques
School of Computer Science & Software Engineering, Monash University Melbourne.
Computer Science, University of Kentucky.
Department of Automation and Applied Informatics, Budapest University of Technology and Economic Sciences.
Show others and affiliations
2002 (English)In: Computational science: international conference, Amsterdam, the Netherlands, April 21-24, 2002; proceedings / [ed] Peter M. A. Sloot, Berlin: Springer , 2002, p. 51-60Conference paper, Published paper (Refereed)
Abstract [en]

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

Place, publisher, year, edition, pages
Berlin: Springer , 2002. p. 51-60
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 2329
Identifiers
URN: urn:nbn:se:ltu:diva-27809DOI: 10.1007/3-540-46043-8_4Scopus ID: 2-s2.0-33748374589Local ID: 15d20f40-dbaf-11dc-b464-000ea68e967bISBN: 978-3-540-43591-4 (print)OAI: oai:DiVA.org:ltu-27809DiVA, id: diva2:1001000
Conference
International Conference on Computational Science : 21/04/2002 - 24/04/2002
Note

Upprättat; 2002; 20080215 (cira)

Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2025-10-03Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Zaslavsky, Arkady

Search in DiVA

By author/editor
Zaslavsky, Arkady

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 20 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf