Davies Bouldin Index Algorithm for Optimizing Clustering Case Studies Mapping School Facilities

Citations Over TimeTop 10% of 2021 papers

Abstract

The lower Davies Bouldin Index (DBI) is considered the best clustering algorithm based on the criteria that yields a cluster set. The purpose of this research is to optimize the clustering results using DBI. The data sources used are the number of villages that have school facilities and the level of education is obtained from the government website (https://www.bps.go.id). The level of education in question is senior high school and vocational high school. The method used is k-means. The results show that from the number of clusters (k = 2, 3, 4, 5, 6) the optimal DBI for (k = 2) is obtained with a value of 0.168 for Measure Type = Mixed Measures. For the value of k = 2, a mapping of areas with L0 (low) = 31 province and L1 (high) = 3 provinces is obtained. The final centroids obtained for each cluster are L0 (315 and 155) and L1 (1710 and 1259). Based on the results of mapping by optimizing k-means and DBI, more than 90% of the villages still have school facilities, especially at the high school and vocational high school levels.

Related Papers

• → Maxmin Data Range Heuristic-Based Initial Centroid Method of Partitional Clustering for Big Data Mining(2021)8 cited
• → Mine Blood Donors Information through Improved K-Means Clustering(2013)5 cited
• → Uncertain Centroid based Partitional Clustering of Uncertain Data(2012)3 cited
• Educational Data Mining in Chin State(2019)