IDEAS home Printed from https://ideas.repec.org/a/ids/injams/v12y2020i3p169-185.html
   My bibliography  Save this article

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

Author

Listed:
  • M. Bhavani
  • K. Thammi Reddy
  • P. Suresh Varma

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.

Suggested Citation

  • M. Bhavani & K. Thammi Reddy & P. Suresh Varma, 2020. "Particle swarm optimisation-based source code plagiarism detection approach using non-negative matrix factorisation algorithm," International Journal of Applied Management Science, Inderscience Enterprises Ltd, vol. 12(3), pages 169-185.
  • Handle: RePEc:ids:injams:v:12:y:2020:i:3:p:169-185
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=108071
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:injams:v:12:y:2020:i:3:p:169-185. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=286 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.