The DOI matches its Crossref record.
Analisis Kinerja Algoritma Winnowing pada Pendeteksian Plagiarisme
Open accessAbstract
Masalah plagiarisme di saat ini dapat diselesaikan. Penelitian ini dilakukan analisis kinerja Algoritma Winnowing pada pendeteksian plagiarisme. Pemilihan Algoritma Winnowing karena dengan menghitung nilai hash dari k-gram, fungsi hash bergulir dipakai mencari nilai hash, setelah itu sebuah window dibentuk dari nilai hash. Di tiap window, nilai hash terkecil dipilih. Ketika lebih dari satu hash nilai terendah, nilai hash paling kanan dipilih. Kemudian semua nilai hash yang dipilih disimpan untuk digunakan sebagai fingerprint dokumen. Fingerprint ini berfungsi sebagai dasar untuk membandingkan kesamaan teks yang disematkan. Hasil penelitian analisis kinerja Algoritma Winnowing ini menunjukan bahwa algoritma ini cukup baik dalam pendeteksian kemiripan teks atau plagiarisme dengan hasil nilai persentase terkecil dari 10 kali pengujian yang ditunjukan pada pengujian ke-10 dengan nilai n-gram n=10, window w=3, waktu proses sec=0.0094 dengan hasil kemiripan teks 47 persen. Hasil ini lebih baik dari hasil kemiripan Algoritma Rabin Karp dari hasil penelitian sebelumnya.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 8
- A. H. Purba and Z. Situmorang, "Analisis Perbandingan Algoritma Rabin-Karp dan Levenshtein Distance dalam Menghitung Kemiripan Teks," J. Tek. Inform. Unika St. Thomas, vol. 02, pp. 24-32, 2017.
- N. Alamsyah, "Perbandingan Algoritma Winnowing dengan Algoritma Rabin Karp untuk Mendeteksi Plagiarisme pada Kemiripan Teks Judul Skripsi," Technol. J. Ilm., vol. 8, no. 3, pp. 124-134, 2017, doi: 10.31602/tji.v8i3.1116. · DOI · Paper page
- I. B. K. S. Arnawa, "Implementasi Algoritma Winnowing dalam Mendeteksi Plagiarisme pada Tugas Mahasiswa," vol. 10, pp. 220-230, 2022.
- W. Hidayat, E. Utami, and A. D. Hartanto, "Pemilihan Parameter Terbaik pada Algoritma Winnowing dalam Mendeteksi Tingkat Kesamaan Dokumen Bahasa Indonesia Selection of the Best Parameters in the Winnowing Algorithm in Detecting the Level of Similarity in Indonesian Documents," Citec J., vol. 7, no. 2, 2020.
- S. Sugiono, H. Herwin, H. Hamdani, and E. Erlin, "Aplikasi Pendeteksi Tingkat Kesamaan Dokumen Teks: Algoritma Rabin Karp Vs. Winnowing," Digit. Zo. J. Teknol. Inf. dan Komun., vol. 9, no. 1, pp. 82-93, 2018, doi: 10.31849/digitalzone.v9i1.1242. · DOI
- G. Hizkia, O. Mangundap, H. Sujaini, and H. S. Pratiwi, "Implementasi Algoritma Winnowing pada Aplikasi," vol. 8, no. 1, pp. 147-153, 2022.
- A. M. A. K. Parewe, A. Aman, and D. P. M. Dewang, "Perbandingan Algoritma Winnowing dan Algoritma Manber dalam Mendeteksi Berita Hoax di Media Sosial," Semin. Nas. Teknol. Inf. dan Komput., pp. 41-46, 2021.
- I. Bagus and K. Surya, "Komparasi Algoritma Winnowing dan Rabin," pp. 345-351.
Cited by
Sorted by citations
Implementasi Algoritma Rabin-Karp pada Pendeteksian Plagiarisme
Saputra, A. K., Endra, R. Y., Ariani, F., Tanjung, T., & Prakarsya, A. (2023) · EXPERT Jurnal Manajemen Sistem Informasi dan Teknologi · doi:10.36448/expert.v13i1.3161 · Cited by 1
Self-citation
Metadata
- Authors
- Saputra, A. K., Erlangga, E., & Tanjung, T.
- Affiliations
- Lampung University (ID)
- Venue
- Explore: Jurnal Sistem Informasi dan Telematika
- Published
- 2022-12-27
- Volume
- 13
- Issue
- 2
- Pages
- 125
- ISSN
- 2087-2062 (ISSN-L)
- 2686-181X
- OpenAlex
- W4313328475
- Cited by
- 1
- References
- 0
- Citations by year
- 2023: 1
- FWCI
- 0.08
- Type
- journal article
- Language
- id
- Open access
- diamond
- doi.org
- Licence
- cc-by
- Locations
- Explore Jurnal Sistem informasi dan telematika (publishedVersion, cc-by)
- Topics
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Social Sciences › Education › Academic integrity and plagiarism
- Physical Sciences › Computer Science › Information Systems › Software Engineering Research
- Keywords
- plagiarism detection, winnowing algorithm, document fingerprinting, text similarity, algorithm performance evaluation
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
