Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal JURNAL SISTEM INFORMASI BISNIS SemanTIK : Teknik Informasi
LM Tajidun, LM
Unknown Affiliation
Computer Science & IT Control & Systems Engineering Economics, Econometrics & Finance

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
ANALISIS PERBANDINGAN ALGORITMA BOYER MOORE DAN ALGORITMA KNUTH MORRIS PRATT PADA APLIKASI TRIPELKA FOODSHOP KENDARI BERBASIS ANDROID Parenrengi, Andi Maghfirah; Saputra, Rizal Adi; Tajidun, LM
semanTIK Vol 3, No 1 (2017): semanTIK
Publisher : Informatics Engineering Department of Halu Oleo University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (408.312 KB)

Abstract

Kemajuan yang sangat pesat dibidang teknologi terutama teknologi informasi komputer mempengaruhi perkembangan dunia bisnis. Tripelka adalah komunitas pengusaha makanan online yang sangat membutuhkan teknologi internet untuk mempercepat penyampaian informasi. Berdasarkan hal itu maka dibuatlah aplikasi pencarian menu makanan berbasis android. Untuk mempersingkat proses penyajian data pada aplikasi ini maka diterapkan pencocokan string pada pencarian menu-menu makanan yang kita inginkan. Ada berbagai jenis algoritma string matching yang umum di gunakan, anatara lain : Algoritma Boyer Moore, Algoritma Brute Force dan Algoritma Knuth Morris Pratt. Dalam penelitian ini dilakukan analisis perbandingan antara Algoritma Boyer Moore dan Algortima Knuth Morris Pratt, untuk menentukan  algoritma yang paling baik digunakan dalam aplikasi Tripelka Foodshop Kendari. Parameter yang digunakan untuk membandingkan kedua algoritma tersebut adalah waktu pencarian dan tingkat keakurasian data yang ditampilkan.  Hasil dari penelitian ini menunjukkan bahwa Algoritma Boyer Moore dan Algoritma Knuth Morris Pratt memiliki tingkat keakurasian yang sama tetapi  Algoritma Boyer Moore adalah algoritma menggunakan waktu pencarian yang lebih cepat dibandingkan Algoritma Knuth Morris Pratt.Kata kunci—Android, Pencocokan String, Algoritma Boyer-Moore, Algoritma Knuth Morris Pratt
Perbandingan Algoritma Winnowing dan Algoritma Rabin-Karp pada Aplikasi Pendeteksi Kesamaan Dokumen Skripsi Nangi, Jumadil; Asmara, Ida Bagus Gede Pala; Sarita, Muh. Ihsan; Jaya, Laode Muh. Golok; Mokui, Hasmina Tari; Tajidun, LM
Jurnal Sistem Informasi Bisnis Vol 14, No 2 (2024): Volume 14 Nomor 2 Tahun 2024
Publisher : Diponegoro University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21456/vol14iss2pp131-142

Abstract

Plagiarism is often found in the academic world and is considered a serious violation because it involves the appropriation of ideas, opinions, or writings of others. A thesis is the final work of a student that must meet scientific standards and be tailored to the field of study. It is important to check the similarity of the thesis using a web-based sistem to prevent plagiarism and ensure academic integrity. This sistem will be developed as a web-based platform with the aim of comparing the Winnowing algorithm and the Rabin-Karp algorithm in checking the similarity of thesis/final project texts with existing thesis data. In principle, both methods involve searching for strings using hashing functions to compare the sought string (m) with the compared string (n) by comparing the results of the hashing function used. However, the Winnowing algorithm differs in that it does not use all hash values from each formed set of grams. The hash values formed in the previous stage will be divided into a window of size (w). In this research, the sistem testing uses data from Computer Engineering students at Halu Oleo University to facilitate checking the plagiarism level of theses using the Rabin-Karp and Winnowing algorithms. In this study, the Rabin-Karp and Winnowing algorithms have been implemented successfully in the plagiarism checking sistem for students' theses. The test results for the comparison of the Winnowing and Rabin-Karp algorithms in terms of processing time show that the Rabin-Karp algorithm takes 1.509 seconds, while the Winnowing algorithm takes 1.508 seconds. Subsequent testing using Normalized Mean Absolute Error (NMAE) reveals that the Rabin-Karp algorithm has an absolute error value of 0.1829, while the Winnowing algorithm has a value of 0.0194. Therefore, based on the NMAE test, the Winnowing algorithm performs better than the Rabin-Karp algorithm.
Co-Authors Andi Maghfirah Parenrengi, Andi Maghfirah Asmara, Ida Bagus Gede Pala Hasmina Tari Mokui Jaya, La Ode Muhammad Golok Jumadil Nangi, Jumadil Muh. Ihsan Sarita, Muh. Ihsan Rizal Adi Saputra