Pengelompokan Data Status Pertanahan Letter C menggunakan Algoritma Partitioning Around Medoids
DOI:
https://doi.org/10.26418/justin.v12i3.79285Keywords:
Partitioning Around Medoids, Letter C, Status PertanahanAbstract
Letter C merupakan pengarsipan data pertanahan yang dikelola oleh desa. Pengelolaan data status pertanahan Letter C di Desa Pandanarum masih dilakukan secara manual yaitu dengan menuliskan history jual beli kedalam buku Letter C. Pada Desa Pandanarum terdapat 3960 data Letter C sehingga dapat mempengaruhi dalam proses pelayanan kepada warga. Pada penelitian ini menggunakan data sampel menggunakan teori Slovin sebesar 363 data dan diambil dari buku ketiga Letter C. Penelitian ditujukan untuk pengelompokan status pertanahan buku Letter C. Pengelompokan dilakukan dengan menggunakan algoritma Partitioning Around Medoids dengan 6 atribut yaitu persil, kelas desa, luas tanah, luas beli, luas jual, dan keterangan. Data Status Pertanahan Letter C dikelompokan kedalam 3 cluster yaitu sudah terjual, belum terjual, dan habis terjual. Dari hasil pengelompokan diperoleh 6 data pada cluster sudah terjual, 344 data pada cluster belum terjual, dan 4 data pada cluster habis terjual dengan nilai Davies Bouldin Index sebesar 0,7804. Dengan pengelompokan Partitioning Around Medoids ini diharapkan dapat membantu petugas desa dalam melakukan pelayanan dan dapat menjaga kondisi dari buku Letter C.
References
I. H. Santi, F. Febrinita, dan W. D. Puspitasari, “Engineering Design Business Process Modelling Letter C Land Data Archiving System with Software Requirement Specifications Approach,†J. Intell. Decis. Support Syst., vol. 6, no. 4, hal. 231–240, 2023, doi: https://doi.org/10.35335/idss.v6i4.187
A. Sahrina, Purwanto, F. Rosyida, D. Prasetyono, I. Sulistio, dan C. E. Pamungkas, “Digitalisasi Dokumen Pertanahan Desa Berbasis Webgis Di Desa Sukorejo Kecamatan Gondanglegi Kabupaten Malang,†MARTABE J. Pengabdi. Masy., vol. 6, no. 12, 2023, doi: 10.31604/jpm.v6i12.4299-4306.
E. Setiawan, I. H. Santi, dan S. N. Budiman, “Sistem Pengelolaan Dan Pengamanan Arsip Data Letter C Desa (Studi Kasus : Kantor Desa Gondang),†J. Mhs. Tek. Inform., vol. 6, no. 2, 2022, doi: https://doi.org/10.36040/jati.v6i2.5602.
N. Sureja, B. Chawda, dan A. Vasant, “An improved Partitioning Around Medoids clustering approach based on the crow search algorithm,†J. Comput. Math. Data Sci., vol. 3, no. April, hal. 100034, 2022, doi: 10.1016/j.jcmds.2022.100034.
I. M. Karo Karo, S. Dewi, Mardiana, F. Ramadhani, dan P. Harliana, “K-Means and Partitioning Around Medoids Algorithm Comparison for Clustering Forest Fire Location in Indonesia,†J. Ecotipe (Electronic, Control. Telecommun. Information, Power Eng., vol. 10, no. 1, hal. 86–94, 2023, doi: 10.33019/jurnalecotipe.v10i1.3896.
W. Y. E, A. Jian, L. Yan, dan W. HongGang, “Optimization of Partitioning Around Medoids Algorithm for Initial Clustering Center,†J. Phys. Conf. Ser., vol. 1487, no. 1, 2020, doi: 10.1088/1742-6596/1487/1/012011.
Y. Sopyan, A. D. Lesmana, dan C. Juliane, “Analisis Algoritma K-Means dan Davies Bouldin Index dalam Mencari Cluster Terbaik Kasus Perceraian di Kabupaten Kuningan,†Build. Informatics, Technol. Sci., vol. 4, no. 3, hal. 1464–1470, 2022, doi: 10.47065/bits.v4i3.2697.
M. Mughnyanti, S. Efendi, dan M. Zarlis, “Analysis of determining centroid clustering x-means algorithm with davies-bouldin index evaluation,†IOP Conf. Ser. Mater. Sci. Eng., vol. 725, no. 1, 2020, doi: 10.1088/1757-899X/725/1/012128.
Salim, Penelitian Pendidikan: Metode, Pendekatan, dan Jenis. Kencana, 2019. [Daring]. Tersedia pada: https://www.google.co.id/books/edition/Penelitian_Pendidikan_Metode_Pendekatan/2fq1DwAAQBAJ?hl=en&gbpv=0
D. Kurmiati, M. Z. Fauzi, A. Falegas, dan Indria, “Klasterisasi Daerah Rawan Gempa Bumi di Indonesia Menggunakan Algoritma K-Medoids,†MALCOM Indones. J. Mach. Learn. Comput. Sci., vol. 1, hal. 47–57, 2021, doi: https://doi.org/10.57152/malcom.v1i1.61.
N. P. Dharshinni dan C. Fandi, “Penerapan Metode K-Medoids Clustering Untuk Mengelompokkan Ketahanan Pangan,†J. MEDIA Inform. BUDIDARMA, vol. 6, no. 4, hal. 2301, Okt 2022, doi: 10.30865/mib.v6i4.4939.
F. Sulianta, Basic Data Mining from A to Z. Feri Sulianta, 2023. [Daring]. Tersedia pada: https://www.google.co.id/books/edition/Basic_Data_Mining_from_A_to_Z/JcLhEAAAQBAJ?hl=en&gbpv=0
C. E. D. Vanegas, J. C. G. MejÃa, F. A. V. Agudelo, dan D. E. S. Duran, “A Representation Based on Essence for the CRISP-DM Methodology,†Comput. y Sist., vol. 27, no. 3, hal. 675–689, 2023, doi: 10.13053/CyS-27-3-3446.
J. Bokrantz, M. Subramaniyan, dan A. Skoogh, “Realising the promises of artificial intelligence in manufacturing by enhancing CRISP-DM,†Prod. Plan. Control, vol. 0, no. 0, hal. 1–21, 2023, doi: 10.1080/09537287.2023.2234882.
B. A. Kuncoro, Pengenalan Prinsip Data Science untuk Pemula. https://www.google.co.id/books/edition/Pengenalan_Prinsip_Data_Science_untuk_Pe/O8kQEAAAQBAJ?hl=en&gbpv=0, 2020. [Daring].
Rifkhan, Pedoman Metodologi Penelitian Data Panel Dan Kuesioner. Penerbit Arab, 2023. [Daring]. Tersedia pada: https://www.google.co.id/books/edition/PEDOMAN_METODOLOGI_PENELITIAN_DATA_PANEL/UN2vEAAAQBAJ?hl=en&gbpv=1&dq=PEDOMAN+METODOLOGI+PENELITIAN+DATA+PANEL+DAN+KUESIONER&pg=PA39&printsec=frontcover
Mesran dkk., Sistem Pendukung Keputusan & Data Mining: Metode dan Penerapannya Dalam Pengambilan Keputusan. Green Press, 2020. Diakses: 14 Desember 2023. [Daring]. Tersedia pada: https://www.google.co.id/books/edition/Sistem_Pendukung_Keputusan_Data_Mining_M/eDXgDwAAQBAJ?hl=en&gbpv=0
Z. Zhang, T. Wu, X. Sun, dan J. Yu, “MPDP Partitioning Around Medoids: Multiple partition differential privacy preserving Partitioning Around Medoids clustering for data publishing in the Internet of Medical Things,†Int. J. Distrib. Sens. Networks, vol. 17, no. 10, 2021, doi: 10.1177/15501477211042543.
J. Han, M. Kamber, dan J. Pei, Data Mining: Concepts and Techniques. 2011. doi: 10.1016/C2009-0-61819-5.
N. H. Harani dan F. A. Nugraha, Segmentasi Pelanggan Menggunakan Python. Kreatif, 2020. [Daring]. Tersedia pada: https://www.google.co.id/books/edition/Segmentasi_Pelanggan_Menggunakan_Python/Bqr7DwAAQBAJ?hl=en&gbpv=1&dq=Segmentasi+Pelanggan+Menggunakan+Python&pg=PA148&printsec=frontcover
I. Werdiningsih, D. C. R. Novitasari, dan D. Z. Haq, Pengelolaan Data Mining dengan Pemrograman Matlab. 2022. [Daring]. Tersedia pada: https://www.google.co.id/books/edition/Pengelolaan_Data_Mining_dengan_Pemrogram/CgOdEAAAQBAJ?hl=en&gbpv=1&dq=Pengelolaan+Data+Mining+dengan+Pemrograman+Matlab&printsec=frontcover
T. B. Sasongko, “Komparasi dan Analisis Kinerja ModelAlgoritma SVM dan PSO-SVM(Studi Kasus Klasifikasi Jalur Minat SMA),†J. Tek. Inform. dan Sist. Inf., vol. 2, no. 2, 2016, doi: https://doi.org/10.28932/jutisi.v2i2.627.
D. D. Aulia dan Nurahman, “Comparison Performance of Partitioning Around Medoids and K-Means Algorithms In Clustering Community Education Levels,†J. Nas. Pendidik. Tek. Inform., vol. 12, no. 2, hal. 273–282, 2023, doi: 10.23887/janapati.v12i2.59789.
D. Jollyta, M. Siddik, H. Mawengkang, dan S. Efendi, Teknik Evaluasi Cluster Solusi Menggunakan Python Dan Rapidminer. Deepublish, 2021. [Daring]. Tersedia pada: https://www.google.co.id/books/edition/Teknik_Evaluasi_Cluster_Solusi_Menggunak/3rcgEAAAQBAJ?hl=en&gbpv=0
Mustika dkk., Data Mining Dan Aplikasinya. Penerbit Widina, 2021. [Daring]. Tersedia pada: https://www.google.co.id/books/edition/DATA_MINING_DAN_APLIKASINYA/53FXEAAAQBAJ?hl=en&gbpv=0
Downloads
Additional Files
Published
Issue
Section
License
Copyright (c) 2024 JUSTIN (Jurnal Sistem dan Teknologi Informasi)
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
The author owns the copyright in his paper and agrees to publish his paper to JUSTIN by giving the rights to the first publication of his paper which is simultaneously licensed under the Creative Commons Attribution License, namely the Similar International 4.0 license (CC BY-NC-SA 4.0).
This is a human-readable summary of (and not a substitute for) the license. Disclaimer.
You are free to:Share "” copy and redistribute the material in any medium or format
Adapt "” remix, transform, and build upon the material
The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
Attribution "” You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
NonCommercial "” You may not use the material for commercial purposes.
ShareAlike "” If you remix, transform, or build upon the material, you must distribute your contributions under the same license as the original.
No additional restrictions "” You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation.
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
