Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Jurnal Diferensialarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Jurnal Diferensial
Article . 2024 . Peer-reviewed
License: CC BY SA
Data sources: Crossref
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Jurnal Diferensial
Article . 2024
Data sources: DOAJ
versions View all 3 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Implementation of K-Nearest Neighbor Algorithm on Density-Based Spatial Clustering Application with Noise Method on Stunting Clustering

Authors: Friansyah Gani; Hasan S. Panigoro; Sri Lestari Mahmud; Emli Rahmi; Salmun K. Nasib; La Ode Nashar;

Implementation of K-Nearest Neighbor Algorithm on Density-Based Spatial Clustering Application with Noise Method on Stunting Clustering

Abstract

This paper studies the implementation of the K-Nearest Neighbor (KNN) algorithm on Density-Based Spatial Clustering Application with Noise (DBSCAN) method on stunting Clustering in the eastern region of Indonesia in 2022. The DBSCAN method is used because it is more efficient to perform the Clustering process for irregular Clustering shapes. The main objective of this study is to apply the KNN algorithm to the DBSCAN Clustering technique in 161 Districts/Cities in 11 provinces in eastern Indonesia. A comparison of the performance evaluation of the DBSCAN Clustering technique is done by considering the value of the Silhouette score, BetaCV score, and Davies-Bouldin score indicating the quality of the Clusters formed with the lowest results scores of 0.67 and 1.84 with epsilon value = 3.4 and minimum point value = 2 resulting in 4 Clusters. The results of Clustering 161 Districts and Cities based on the factors that cause stunting formed 4 Clusters where Cluster 0 consists of 119 Districts and Cities with very high stunting characteristics, Cluster 1 consists of 3 Districts and Cities with high stunting characteristics, the results of Cluster 2 consist of 2 Districts and Cities with low stunting characteristics, then the results of Cluster 2 consist of 2 Districts and Cities with low stunting characteristics and Cluster 3 consists of 2 Cities with very low stunting characteristics.

Keywords

dbscan, knn, QA1-939, davies-bouldin, betacv, silhouette, Mathematics, clustering

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
gold