PERBANDINGAN PERFORMA ALGORITMA K-MEANS, K-MEDOIDS, DAN DBSCAN DALAM PENGGEROMBOLAN PROVINSI DI INDONESIA BERDASARKAN INDIKATOR KESEJAHTERAAN MASYARAKAT

Ferista Wahyu Saputri, Dede Brahma Arianto
{"title":"PERBANDINGAN PERFORMA ALGORITMA K-MEANS, K-MEDOIDS, DAN DBSCAN DALAM PENGGEROMBOLAN PROVINSI DI INDONESIA BERDASARKAN INDIKATOR KESEJAHTERAAN MASYARAKAT","authors":"Ferista Wahyu Saputri, Dede Brahma Arianto","doi":"10.47111/jti.v7i2.9558","DOIUrl":null,"url":null,"abstract":"One of the development orientations in Indonesia is to improve the welfare of society. Therefore, it is important to identify and understand the characteristics of community welfare in each province in order to determine effective and targeted development strategies. Cluster analysis is one of the analyses that can be used to group provinces in Indonesia that have homogeneous characteristics within a cluster. The partition method is the simplest and fundamental approach to cluster analysis, but it can only find clusters with spherical-shaped forms. On the other hand, DBSCAN is a density-based clustering algorithm that can be used to find clusters with arbitrary shapes. In this study, the performance of the K-Means, K-Medoids, and DBSCAN algorithms was compared using data that had been dimensionally reduced using the t-SNE method. The data used was the indicator data of community welfare in the year 2022. The evaluation results of clustering based on the highest Silhouette coefficient (0.917) and the lowest Davies-Bouldin index (0.089) indicate that the best clustering methods are K-Means and DBSCAN with parameters perplexity = 1, minPts = 2, and epsilon = 9. Both methods produce the same result, which is the formation of eight clusters.    ","PeriodicalId":214711,"journal":{"name":"Jurnal Teknologi Informasi: Jurnal Keilmuan dan Aplikasi Bidang Teknik Informatika","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Teknologi Informasi: Jurnal Keilmuan dan Aplikasi Bidang Teknik Informatika","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47111/jti.v7i2.9558","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

One of the development orientations in Indonesia is to improve the welfare of society. Therefore, it is important to identify and understand the characteristics of community welfare in each province in order to determine effective and targeted development strategies. Cluster analysis is one of the analyses that can be used to group provinces in Indonesia that have homogeneous characteristics within a cluster. The partition method is the simplest and fundamental approach to cluster analysis, but it can only find clusters with spherical-shaped forms. On the other hand, DBSCAN is a density-based clustering algorithm that can be used to find clusters with arbitrary shapes. In this study, the performance of the K-Means, K-Medoids, and DBSCAN algorithms was compared using data that had been dimensionally reduced using the t-SNE method. The data used was the indicator data of community welfare in the year 2022. The evaluation results of clustering based on the highest Silhouette coefficient (0.917) and the lowest Davies-Bouldin index (0.089) indicate that the best clustering methods are K-Means and DBSCAN with parameters perplexity = 1, minPts = 2, and epsilon = 9. Both methods produce the same result, which is the formation of eight clusters.    
印尼的发展方向之一是提高社会福利。因此,识别和了解各省社区福利的特点,以确定有效和有针对性的发展战略是非常重要的。聚类分析是一种分析,可用于分组在印度尼西亚的省份,具有同质的特点,在一个集群。分割法是聚类分析最简单、最基本的方法,但它只能找到球形的聚类。另一方面,DBSCAN是一种基于密度的聚类算法,可用于查找具有任意形状的聚类。在本研究中,使用使用t-SNE方法降维的数据,比较了K-Means、k - medioids和DBSCAN算法的性能。使用的数据为2022年社区福利指标数据。剪影系数最高(0.917)、Davies-Bouldin指数最低(0.089)的聚类评价结果表明,当参数perplexity = 1、minPts = 2、epsilon = 9时,最佳聚类方法为K-Means和DBSCAN。两种方法都会产生相同的结果,即形成八个簇。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信