IMPLEMENTASI ALGORITMA NEAREST NEIGHBOR PADA PENERIMAAN PEGAWAI BARU PADA MTS IKHWANUTS TSALITS TALUN KENAS

 (*)Rahmad Dani Sitepu Mail (STMIK Budi Darma Medan, Indonesia)
 Efori Buulolo (STMIK Budi Darma Medan, Indonesia)

(*) Corresponding Author

Abstract

Accumulation ofnemployeenacceptance file on unatapped MTs Ikhwanuts Tsalits Talun Kenas is a problem that must be solved well, in order to create a utilization of science in the process of receiving employess. In data mining, there are many branches of science contained one of which is nearest neighbor. Nearest neighbor is a method of data mning by calculating the proximity between new cases and old cases. Appropriate steps taken to utilize the science of data mining in overcoming the accumulation of existing files that is implementing the method nearest neighbor

Full Text:

PDF


Article Metrics

Abstract view : 627 times
PDF - 260 times

References

EKO PRASETYO, 2012. Data Mining-Konsep dan Aplikasi Menggunakan Matlab, Yogyakarta:ANDI. RAHMAT PRIYANTO, 2009. Langsung Bisa Visual Basic.Net 2008, Bandung. WAHANA KOMPUTER, 2010 Panduan Belajar MySql Database Server, Jakarta: mediakita. KUSRINI dan EMHA TAUFIQ LUTHFI, 2009 Algoritma Data Mining, Yogyakarta. ROSA A. S, 2013 Rekayasa Perangkat Lunak, Bandung:Informatika. ELLYTA YULLYANTI, 2009 “Analisis Proses Rekrutmen dan Seleksi pada Kinerja Pegawai”, hlm. 131-139, vol. 16. RICKY IMANUEL NDAUMANU, KUSRINI, M.RUDYANTO ARIEF, 2014 “Analisis Prediksi Tingkat Pengunduran Diri Mahasiswa dengan Metode K-Nearest Neighbor”, vol.1, No.1. KENNEDI TAMPUBOLON, HOGA SARAGIH, BOBBY REZA, 2009“Implementasi Data Mining Algortima Apriori Pada Sistem Persediaan Alat-alat Kesehatan”, vol.1, No.1.

Refbacks

  • There are currently no refbacks.


Copyright (c) 2017 KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer)




KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer)
P3M STMIK Budi Darma
Sekretariat Jln. Sisingamangaraja No. 338 Telp 061-7875998
email: komik@univ-bd.ac.id, komik.budidarma@gmail.com

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.