Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : EXPERT: Jurnal Manajemen Sistem Informasi dan Teknologi

Perhitungan Estimasi Upaya Pengembangan Software Pulsa Online dengan Fuzzy C-Means dan Fuzzy K-Means Tia Tanjung; Fenty Ariani; Wiwin Susanty; Arnes Yuli Vandika
EXPERT: Jurnal Manajemen Sistem Informasi dan Teknologi Vol 12, No 1 (2022): June
Publisher : Universitas Bandar Lampung (UBL)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36448/expert.v12i1.2471

Abstract

Top-up can be done by prepaid and postpaid. Top-up at this time can also be done by way of online purchases. Credit with a prepaid system is a real-time top-up. Payments are made before the customer uses credit. Prepaid credit is different from postpaid which is not real-time and is done after the customer uses credit. Before credit can be used, it is necessary to create a credit server first. In this case, limited resources become an obstacle in completing the credit server creation which will later be used by credit users. Therefore, it is necessary to estimate the effort in the development of the server application, so that the estimation can be known, both in terms of resources, and processing time to estimates in terms of costs. In this case, the appropriate method should be used to overcome the obstacle and reduce the risk of software development. There are several ways to use the Fuzzy K-Mean and Fuzzy C-Means methods to complete the creation of impulse servers, perform analysis and interpretation, and provide information and actions for the quality of research output, education, and evaluation research. The result of the grouping comparison is to produce a derivative formula for the Fuzzy K-Mean and Fuzzy C-Means algorithms.
Implementasi Algoritma Rabin-Karp pada Pendeteksian Plagiarisme Ari Kurniawan Saputra; Robby Yuli Endra; Fenty Ariani; Tia Tanjung; Agustan Prakarsya
EXPERT: Jurnal Manajemen Sistem Informasi dan Teknologi Vol 13, No 1 (2023): June
Publisher : Universitas Bandar Lampung (UBL)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36448/expert.v13i1.3161

Abstract

Implementation of Rabin-Karp Algorithm in Plagiarism Detection - Plagiarism is a crime and a scourge of science. To avoid plagiarism in scientific articles, as in the case of this research, string-matching methods can be used. This study aims to implement the Rabin-Karp Algorithm in detecting plagiarism in scientific writing based on the level of text similarity. The Rabin-Karp algorithm was chosen for this research problem because previous studies revealed that the Rabin-Karp premise is to separate the hash value of the input string from the text substring. Assuming they are the same, the character check is performed one more time, and if not, moves the substring aside. The main part of this computation exhibit is successfully calculating the hash of the substring when applied. This research is quantitative. The stages of this research flow were carried out by testing the implementation of the Rabin-Karp algorithm. Based on the calculation above, the percentage of similarity between Test Sentence 1 and Test Sentence 2 is 77.96%. Referring to previous studies, the Winnowing algorithm was found to be better at detecting text similarities than the Rabin-Karp algorithm. This is shown in the results of the similarity detection test of 30 paper documents as test data with the results of the average percentage value. Rabin-Karp Algorithm 41.41% and Winnowing Algorithm 35.15%. This study shows that the Rabin-Karp Algorithm does not work optimally in detecting text similarity, so further research needs additional methods to calculate a good level of similarity to optimize the performance of the Rabin-Karp Algorithm.