基于源代码相似度分数识别抄袭的编程作业

IF 3 Q1 EDUCATION & EDUCATIONAL RESEARCH
Hayden Cheers, Yuqing Lin
{"title":"基于源代码相似度分数识别抄袭的编程作业","authors":"Hayden Cheers, Yuqing Lin","doi":"10.1080/08993408.2022.2060633","DOIUrl":null,"url":null,"abstract":"ABSTRACT Background and Context Source code plagiarism is a common occurrence in undergraduate computer science education. Many source code plagiarism detection tools have been proposed to address this problem. However, such tools do not identify plagiarism, nor suggest what assignment submissions are suspicious of plagiarism. Source code plagiarism detection tools simply evaluate and report the similarity of assignment submissions. Detecting plagiarism always requires additional human intervention. Objective This work presents an approach that enables the automated identification of suspicious assignment submissions by analysing similarity scores as reported by source code plagiarism detection tools. Method Density-based clustering is applied to a set of reported similarity scores. Clusters of scores are used to incrementally build an association graph. The process stops when there is an oversized component found in the association graph, representing a larger than expected number of students plagiarising. Thus, the constructed association graph represents groups of colluding students. Findings The approach was evaluated on data sets of real and simulated cases of plagiarism. Results indicate that the presented approach can accurately identify groups of suspicious assignment submissions, with a low error rate. Implications The approach has the potential to aid instructors in the identification of source code plagiarism, thus reducing the workload of manual reviewing.","PeriodicalId":45844,"journal":{"name":"Computer Science Education","volume":" ","pages":""},"PeriodicalIF":3.0000,"publicationDate":"2022-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Identifying plagiarised programming assignments based on source code similarity scores\",\"authors\":\"Hayden Cheers, Yuqing Lin\",\"doi\":\"10.1080/08993408.2022.2060633\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT Background and Context Source code plagiarism is a common occurrence in undergraduate computer science education. Many source code plagiarism detection tools have been proposed to address this problem. However, such tools do not identify plagiarism, nor suggest what assignment submissions are suspicious of plagiarism. Source code plagiarism detection tools simply evaluate and report the similarity of assignment submissions. Detecting plagiarism always requires additional human intervention. Objective This work presents an approach that enables the automated identification of suspicious assignment submissions by analysing similarity scores as reported by source code plagiarism detection tools. Method Density-based clustering is applied to a set of reported similarity scores. Clusters of scores are used to incrementally build an association graph. The process stops when there is an oversized component found in the association graph, representing a larger than expected number of students plagiarising. Thus, the constructed association graph represents groups of colluding students. Findings The approach was evaluated on data sets of real and simulated cases of plagiarism. Results indicate that the presented approach can accurately identify groups of suspicious assignment submissions, with a low error rate. Implications The approach has the potential to aid instructors in the identification of source code plagiarism, thus reducing the workload of manual reviewing.\",\"PeriodicalId\":45844,\"journal\":{\"name\":\"Computer Science Education\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":3.0000,\"publicationDate\":\"2022-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Science Education\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/08993408.2022.2060633\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"EDUCATION & EDUCATIONAL RESEARCH\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Science Education","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/08993408.2022.2060633","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"EDUCATION & EDUCATIONAL RESEARCH","Score":null,"Total":0}
引用次数: 0

摘要

本文章由计算机程序翻译,如有差异,请以英文原文为准。
Identifying plagiarised programming assignments based on source code similarity scores
ABSTRACT Background and Context Source code plagiarism is a common occurrence in undergraduate computer science education. Many source code plagiarism detection tools have been proposed to address this problem. However, such tools do not identify plagiarism, nor suggest what assignment submissions are suspicious of plagiarism. Source code plagiarism detection tools simply evaluate and report the similarity of assignment submissions. Detecting plagiarism always requires additional human intervention. Objective This work presents an approach that enables the automated identification of suspicious assignment submissions by analysing similarity scores as reported by source code plagiarism detection tools. Method Density-based clustering is applied to a set of reported similarity scores. Clusters of scores are used to incrementally build an association graph. The process stops when there is an oversized component found in the association graph, representing a larger than expected number of students plagiarising. Thus, the constructed association graph represents groups of colluding students. Findings The approach was evaluated on data sets of real and simulated cases of plagiarism. Results indicate that the presented approach can accurately identify groups of suspicious assignment submissions, with a low error rate. Implications The approach has the potential to aid instructors in the identification of source code plagiarism, thus reducing the workload of manual reviewing.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Science Education
Computer Science Education EDUCATION & EDUCATIONAL RESEARCH-
CiteScore
6.90
自引率
3.70%
发文量
23
期刊介绍: Computer Science Education publishes high-quality papers with a specific focus on teaching and learning within the computing discipline. The journal seeks novel contributions that are accessible and of interest to researchers and practitioners alike. We invite work with learners of all ages and across both classroom and out-of-classroom learning contexts.
×
引用
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学术官方微信