Particle swarm optimisation-based source code plagiarism detection approach using non-negative matrix factorisation algorithm

IF 0.3 Q4 MANAGEMENT
M. Bhavani, K. T. Reddy, P. Varma
{"title":"Particle swarm optimisation-based source code plagiarism detection approach using non-negative matrix factorisation algorithm","authors":"M. Bhavani, K. T. Reddy, P. Varma","doi":"10.1504/ijams.2020.10028577","DOIUrl":null,"url":null,"abstract":"Source code plagiarism is easy to do the task, but very difficult to detect without proper tool support. Various source code similarity detection systems have been developed to help detect source code plagiarism. Numerous efforts have been made in the literature to introduce an efficient source code detection approach with less time complexity and accurate classification of plagiarised codes. However, there exists a tradeoff amongst the less complexity and high accuracy. In a similar way, this paper likewise attempted to build a framework to detect the plagiarised codes from the source code corpus. This approach employed an intelligent swarm optimisation algorithm known as PSO in the detection phase and robust matrix factorisation algorithm known as non-negative matrix factorisation based on alternative least square (ALS) algorithm for reduction of features from the sparse matrix. Depending on the implementation, ALS is very fast and significantly less work than an SVD implementation. The experimental results showed that it has good performance compared to the other existing approaches such as precision and recall.","PeriodicalId":38716,"journal":{"name":"International Journal of Applied Management Science","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2020-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Applied Management Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijams.2020.10028577","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0

Abstract

Source code plagiarism is easy to do the task, but very difficult to detect without proper tool support. Various source code similarity detection systems have been developed to help detect source code plagiarism. Numerous efforts have been made in the literature to introduce an efficient source code detection approach with less time complexity and accurate classification of plagiarised codes. However, there exists a tradeoff amongst the less complexity and high accuracy. In a similar way, this paper likewise attempted to build a framework to detect the plagiarised codes from the source code corpus. This approach employed an intelligent swarm optimisation algorithm known as PSO in the detection phase and robust matrix factorisation algorithm known as non-negative matrix factorisation based on alternative least square (ALS) algorithm for reduction of features from the sparse matrix. Depending on the implementation, ALS is very fast and significantly less work than an SVD implementation. The experimental results showed that it has good performance compared to the other existing approaches such as precision and recall.
基于粒子群优化的非负矩阵分解源代码抄袭检测方法
源代码抄袭很容易完成任务,但如果没有适当的工具支持,很难检测。各种源代码相似度检测系统已经开发出来,以帮助检测源代码抄袭。文献中已经做了大量的努力来引入一种有效的源代码检测方法,该方法具有较低的时间复杂度和对抄袭代码的准确分类。然而,在较低的复杂性和较高的准确性之间存在权衡。同样,本文也试图构建一个从源代码语料库中检测抄袭代码的框架。该方法在检测阶段采用智能群优化算法(PSO)和鲁棒矩阵分解算法(基于可选最小二乘(ALS)算法的非负矩阵分解)从稀疏矩阵中约简特征。根据实现的不同,ALS非常快,而且比SVD实现的工作量少得多。实验结果表明,该方法在查准率和查全率等方面具有较好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Applied Management Science
International Journal of Applied Management Science Business, Management and Accounting-Strategy and Management
CiteScore
1.20
自引率
0.00%
发文量
21
×
引用
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学术官方微信