Article Per Year (5 Year)
p-Index From 2019 - 2024
0.23
P-Index
This Author published in this journals
All Journal KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer)
Rizky Meliani Astri Hasibuan
Universitas Budi Darma, Medan
Computer Science & IT Control & Systems Engineering Electrical & Electronics Engineering Engineering

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

Found 1 Documents
Search
Journal : KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer)

 1 
Algoritma Clustering K-Nearest Neighbor Dalam Pengelompokan Masyarakat Kecamatan Medan Area Berdasarkan Tingkat Ekonomi Keluarga Rizky Meliani Astri Hasibuan; Efori Bu’ulolo; Sumiaty Adelina Hutabarat
KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) Vol 6, No 1 (2022): Challenge and Opportunity For Z Generation in Metaverse Era
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/komik.v6i1.5756

Abstract

An economy that is constantly changing and developing may result in increased economic difficulties. Current economic developments have decreased to 4.79, causing poverty in Indonesia to increase. To see the condition of the people's economy, it is necessary to collect detailed data so that people with a lower economy get assistance. The problems faced in this study are data collection and classification of the economic level of the population. The process is not very efficient because it is done manually. Classification procedures will only be carried out when necessary. Controlling the welfare of the population has not been carried out in detail. To overcome these problems, we need a system so that the grouping of people who have a classification from high to low economic level. This study uses the K-NN Clustring Algorithm which requires information training to classify objects that are very close. In the last process the Clustring K-NN algorithm is a method for calculating the ratio of old data to updated information. As well as looking for the highest data occurrence value that will be used as a reference as a result.
Co-Authors Efori Bu’ulolo Hutabarat, Sumiaty Adelina