RABIN-CARP IMPLEMENTATION IN MEASURING SIMALIRITY OF RESEARCH PROPOSAL OF STUDENTS
Keywords:plagiarism, thesis proposal, rabin-karp
AbstractPlagiarism is the use of data, language and writing without including the original author or source. The place where palgiate practice occurs most often is the academic environment. In the academic world, the most frequently plagiarized thing is scientific work, for example thesis. To minimize the practice of plagiarism, it is not enough to just remind students. Therefore we need a system or application that can help in measuring the level of similarity of student thesis proposals in order to minimize plagiarism practice. In computer science, the Rabin-Karp algorithm can be used in measuring the level of similarity of texts. The Rabin-Karp algorithm is a string matching algorithm that uses a hash function as a comparison between the search string (m) and substrings in text (n). The Rabin-Karp algorithm is a string search algorithm that can work for large data sizes. The test results show that the use of values on k-gram has an effect on the results of the measurement of similarity levels. In addition, it was also found that the use of the value 5 on k-gram was faster in executing than the values 4 and 6.
J. Agarwal et al., “Intelligent plagiarism detection mechanism using semantic technology: A different approach,” Proc. 2013 Int. Conf. Adv. Comput. Commun. Informatics, ICACCI 2013, pp. 779–783, 2013.
G. Acampora and G. Cosma, “A Fuzzy-based approach to programming language independent source-code plagiarism detection,” IEEE Int. Conf. Fuzzy Syst., vol. 2015–Novem, 2015.
A. Yudhana, A. D. Djayati, and Sunardi, “Sistem Deteksi Plagiarisme Dokumen Karya Ilmiah dengan Algoritma Pencocokan Pola,” Jurti, vol. 1, no. 2. pp. 178–187, 2017.
F. T. Informasi et al., “PERBANDINGAN ALGORITMA WINNOWING DENGAN ALGORITMA RABIN KARP UNTUK MENDETEKSI,” vol. 8, no. 3, pp. 124–134, 2017.
N. Dayarathne and R. Ragel, “Accelerating Rabin Karp on a Graphics Processing Unit (GPU) using Compute Unified Device Architecture (CUDA),” 2014 7th Int. Conf. Inf. Autom. Sustain. "Sharpening Futur. with Sustain. Technol. ICIAfS 2014, 2014.
H. I. M. Alzeini, S. A. Hameed, and M. H. Habaebi, “Optimizing OLAP heterogeneous computing based on Rabin-Karp Algorithm,” 2013 IEEE Int. Conf. Smart Instrumentation, Meas. Appl. ICSIMA 2013, no. November, pp. 26–27, 2013.
O. S. Joshi, B. R. Upadhvay, and M. Supriya, “Parallelized Advanced Rabin-Karp Algorithm for String Matching,” 2017 Int. Conf. Comput. Commun. Control Autom. ICCUBEA 2017, pp. 1–5, 2018.
L. S. N. Nunes, J. L. Bordim, Y. Ito, and K. Nakano, “A Prefix-Sum-Based Rabin-Karp Implementation for Multiple Pattern Matching on GPGPU,” Proc. - 2018 6th Int. Symp. Comput. Networking, CANDAR 2018, pp. 139–145, 2018.
E. Rasywir, Y. Pratama, Hendrawan, and M. Istoningtyas, “Removal of modulo as hashing modification process in essay scoring system using rabin-karp,” Proc. 2018 Int. Conf. Electr. Eng. Comput. Sci. ICECOS 2018, vol. 2019–Janua, pp. 159–164, 2019.
How to Cite
The proposed policy for journals that offer open access
Authors who publish with this journal agree to the following terms:
- Copyright on any article is retained by the author(s).
- Author grant the journal, right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work’s authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal’s published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
- The article and any associated published material is distributed under the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License