筛选与扩展筛选:抄袭检测算法的比较分析

Shiva Shrestha, Sushan Shakya, Sandeep Gautam
{"title":"筛选与扩展筛选:抄袭检测算法的比较分析","authors":"Shiva Shrestha, Sushan Shakya, Sandeep Gautam","doi":"10.36548/jtcsst.2023.3.001","DOIUrl":null,"url":null,"abstract":"Plagiarism is the main problem in the digital world, as people use others’ content without giving prior credit to the creator. Therefore, there should be proper and efficient algorithms to find plagiarized content on the Internet. This research proposes two algorithms: the winnowing algorithm and the extended winnowing algorithm. The winnowing algorithm can only calculate the similarity rate between documents, whereas the extended algorithm can mark the plagiarized text segment in the compared records along with their similarity rates. The similarity rate in both algorithms has been calculated using the Jaccard Coefficient. Although the extended algorithm is beneficial as it provides a text marking feature, it consumes more computation power, which is discussed in this study. There are research works done previously using this approach, but none has compared the algorithms’ performance on small texts. Thus, this research utilizes the Twitter form of data to test these algorithms’ performance, as it contains a maximum of 280 characters. The application proposed to detect plagiarism in tweets has been developed using Python as the backend and React as the front-end technology.","PeriodicalId":107574,"journal":{"name":"Journal of Trends in Computer Science and Smart Technology","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Winnowing vs Extended-Winnowing: A Comparative Analysis of Plagiarism Detection Algorithms\",\"authors\":\"Shiva Shrestha, Sushan Shakya, Sandeep Gautam\",\"doi\":\"10.36548/jtcsst.2023.3.001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Plagiarism is the main problem in the digital world, as people use others’ content without giving prior credit to the creator. Therefore, there should be proper and efficient algorithms to find plagiarized content on the Internet. This research proposes two algorithms: the winnowing algorithm and the extended winnowing algorithm. The winnowing algorithm can only calculate the similarity rate between documents, whereas the extended algorithm can mark the plagiarized text segment in the compared records along with their similarity rates. The similarity rate in both algorithms has been calculated using the Jaccard Coefficient. Although the extended algorithm is beneficial as it provides a text marking feature, it consumes more computation power, which is discussed in this study. There are research works done previously using this approach, but none has compared the algorithms’ performance on small texts. Thus, this research utilizes the Twitter form of data to test these algorithms’ performance, as it contains a maximum of 280 characters. The application proposed to detect plagiarism in tweets has been developed using Python as the backend and React as the front-end technology.\",\"PeriodicalId\":107574,\"journal\":{\"name\":\"Journal of Trends in Computer Science and Smart Technology\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Trends in Computer Science and Smart Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.36548/jtcsst.2023.3.001\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Trends in Computer Science and Smart Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.36548/jtcsst.2023.3.001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

剽窃是数字世界的主要问题,因为人们使用他人的内容而事先没有注明作者的名字。因此,应该有适当和有效的算法来发现互联网上的抄袭内容。本研究提出了两种算法:分选算法和扩展分选算法。筛选算法只能计算文档之间的相似率,而扩展算法可以标记比较记录中的剽窃文本片段及其相似率。用Jaccard系数计算了两种算法的相似率。扩展后的算法虽然提供了文本标记的功能,但它消耗了更多的计算能力,这在本研究中进行了讨论。以前也有使用这种方法的研究工作,但没有人比较过算法在小文本上的表现。因此,本研究利用Twitter形式的数据来测试这些算法的性能,因为它最多包含280个字符。我们提出的用于检测推文抄袭的应用程序是使用Python作为后端,React作为前端技术开发的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Winnowing vs Extended-Winnowing: A Comparative Analysis of Plagiarism Detection Algorithms
Plagiarism is the main problem in the digital world, as people use others’ content without giving prior credit to the creator. Therefore, there should be proper and efficient algorithms to find plagiarized content on the Internet. This research proposes two algorithms: the winnowing algorithm and the extended winnowing algorithm. The winnowing algorithm can only calculate the similarity rate between documents, whereas the extended algorithm can mark the plagiarized text segment in the compared records along with their similarity rates. The similarity rate in both algorithms has been calculated using the Jaccard Coefficient. Although the extended algorithm is beneficial as it provides a text marking feature, it consumes more computation power, which is discussed in this study. There are research works done previously using this approach, but none has compared the algorithms’ performance on small texts. Thus, this research utilizes the Twitter form of data to test these algorithms’ performance, as it contains a maximum of 280 characters. The application proposed to detect plagiarism in tweets has been developed using Python as the backend and React as the front-end technology.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信