Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 2

Selection of the Best K-Gram Value on Modified Rabin-Karp Algorithm

IJCCS (Indonesian Journal of Computing and Cybernetics Systems) · Vol. 16 No. 1 (2022) · pp. 11–22

DOI
10.22146/ijccs.63686
ISSN
2460-7258, 1978-1520
Published
2022-01-31
Publisher
IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

The Rabin-Karp algorithm is used to detect similarity using hashing techniques, from related studies modifications have been made in the hashing process but in previous studies have not been conducted research for the best k value in the K-Gram process. At the stage of stemming the Nazief & Adriani algorithm is used to transform the words into basic words. The researcher uses several variations of K-Gram values to determine the best K-Gram values. The analysis was performed using Ukara Enhanced public data obtained from the Kaggle with a total of 12215 data. The student essay answers data totaled to 258 data in the group A and 305 in the group B, every student essay answers data in each group will be compared with the answers of other fellow group member. Research results are the value of k = 3 has the best performance which has the highest some interpretations of 1-14% (Little degree of similarity) and 15-50% (Medium level of similarity) compared to values of k = 5, 7, and 9 which have the highest number of interpretation results 0%-0.99% (Document is different). However, if the students essay answers compared have 100% (Exactly the same) interpretations, the k value on K-Gram does not affect the results.

Keywords

Collaboration network of the authors

31 authors · 63 co-authorship links · 8 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Universitas Amikom Yogyakarta
  • State University of Malang
  • Universitas AKPRIND Indonesia
  • Institut Teknologi Sepuluh Nopember
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Ahmad Fikri IskandarUniversitas Amikom Yogyakarta4
Anggit Dwi HartantoUniversitas Amikom Yogyakarta4
Mursyid ArdiansyahUniversitas Amikom Yogyakarta2
Suwanto RaharjoUniversitas AKPRIND Indonesia2
Agung Budi PrasetyoUniversitas Amikom Yogyakarta2
Kusrini KusriniUniversitas Amikom Yogyakarta2
Catur Riyono Heri WibowoUniversitas Amikom Yogyakarta1
HanafiAffiliation unknown1
Agung Budi PrasetioUniversitas Amikom Yogyakarta1
Kartikasari Kusuma AgustiningsihUniversitas Amikom Yogyakarta1
Muhammad Altoumi AlsyaibaniUniversitas Amikom Yogyakarta1
Kartika Candra KiranaInstitut Teknologi Sepuluh Nopember1
Slamet WibawantoState University of Malang1
Ahmad HamdanState University of Malang1
Ade PujiantoUniversitas Amikom Yogyakarta1
Veny Cahya HarditaUniversitas Amikom Yogyakarta1
Emha Taufiq LuthfiUniversitas Amikom Yogyakarta1
Wahyu Krisna HidayatUniversitas Amikom Yogyakarta1
Agung Prasetio BudiUniversitas Amikom Yogyakarta1
Takhamo GoriUniversitas Amikom Yogyakarta1
Hanif Al FattaUniversitas Amikom Yogyakarta1
Arief SetyantoUniversitas Amikom Yogyakarta1
Mardi Siswo UtomoAffiliation unknown1
Mei KurniawanAffiliation unknown1
M. SuyantoAffiliation unknown1
KusriniAffiliation unknown1
Aiman MukhlishahAffiliation unknown1
Erwin SyahrudinUniversitas Amikom Yogyakarta1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://journal.ugm.ac.id/ijccs/oai, first harvested 26 Okt 2026, last seen 26 Okt 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Selection of the Best K-Gram Value on Modified Rabin-Karp Algorithm</dc:title>
	<dc:creator>Hidayat, Wahyu</dc:creator>
	<dc:creator>Utami, Ema</dc:creator>
	<dc:creator>Sunyoto, Andi</dc:creator>
	<dc:subject xml:lang="en-US">Computer Science</dc:subject>
	<dc:subject xml:lang="en-US">Similarity; Nazief &amp; Adriani Stemming Algorithm; Rabin-Karp Algorithm; Dice Similarity Coefficient</dc:subject>
	<dc:description xml:lang="en-US">The Rabin-Karp algorithm is used to detect similarity using hashing techniques, from related studies modifications have been made in the hashing process but in previous studies have not been conducted research for the best k value in the K-Gram process. At the stage of stemming the Nazief &amp; Adriani algorithm is used to transform the words into basic words. The researcher uses several variations of K-Gram values to determine the best K-Gram values. The analysis was performed using Ukara Enhanced public data obtained from the Kaggle with a total of 12215 data. The student essay answers data totaled to 258 data in the group A and 305 in the group B, every student essay answers data in each group will be compared with the answers of other fellow group member. Research results are the value of k = 3 has the best performance which has the highest some interpretations of 1-14%  (Little degree of similarity) and 15-50% (Medium level of similarity) compared to values of k = 5, 7, and 9 which have the highest number of interpretation results 0%-0.99% (Document is different). However, if the students essay answers compared have 100% (Exactly the same) interpretations, the k value on K-Gram does not affect the results.</dc:description>
	<dc:publisher xml:lang="en-US">IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2022-01-31</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US"></dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.ugm.ac.id/ijccs/article/view/63686</dc:identifier>
	<dc:identifier>10.22146/ijccs.63686</dc:identifier>
	<dc:source xml:lang="en-US">IJCCS (Indonesian Journal of Computing and Cybernetics Systems); Vol 16, No 1 (2022): January; 11-22</dc:source>
	<dc:source>2460-7258</dc:source>
	<dc:source>1978-1520</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journal.ugm.ac.id/ijccs/article/view/63686/33159</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2022 IJCCS (Indonesian Journal of Computing and Cybernetics Systems)</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>