Comparative Analysis Clustering Algorithm for Government’s Budget Performance Data

Isnen Hadi Al Ghozali; Ibnu Afan; Triardani Lestari

doi:10.31154/cogito.v10i1.611.578-591

Authors

Isnen Hadi Al Ghozali Universitas Budi Luhur https://orcid.org/0000-0001-8155-6438
Ibnu Afan Magister Ilmu Komputer Universitas Budi Luhur
Triardani Lestari Directorate General of Budget Ministry of Finance

DOI:

https://doi.org/10.31154/cogito.v10i1.611.578-591

Keywords:

k-means, DBSCAN, AHC, Clustering, budget performance

Abstract

The government's budget performance is a benchmark for the government's success in optimizing people's money to achieve national goals. Even though performance measurement has reached the Work Unit level, the data formed still do not have a specific grouping, in the sense of unstructured data. The purpose of this research is to find the best clustering algorithm for classifying budget performance data. The data used is budget performance data for 19,460 Indonesian Government Work Units. The data is sourced from the SMART application and the OM SPAN application. This research uses a comparative study approach for the K-Means algorithm, DBSCAN, and agglomerative hierarchical clustering (AHC). Evaluation of the clustering results formed using the Davies-Bouldin Index (DBI) method. The AHC algorithm with k = 6 achieved the lowest DBI value of 0.3583472. The DBI value for the DBSCAN algorithm with MinPts = 10 is 0.5398259. However, the AHC algorithm is not good in terms of ease of implementation. Therefore, the K-means algorithm with parameters k = 10 is the best alternative. The K-Means algorithm gets a DBI value of 1.052678. The K-Means algorithm produces 10 clusters. Based on knowledge extraction, it is determined that cluster 2 and cluster 5 are ideal clusters in terms of budget performance. While the clusters that require attention are cluster 1, cluster 3, cluster 4, and cluster 8.

References

K. P. Simanjuntak and U. Khaira, “Hotspot Clustering in Jambi Province Using AgglomerativeHierarchical Clustering Algorithm,” MALCOM: Indonesian Journal ofMachine Learningand Computer Science, vol. 1, no. 1, pp. 7–16, 2021.

A. Triayudi and I. Fitri, “A new agglomerative hierarchical clustering to model student activity in online learning,” TELKOMNIKA, vol. 17, no. 3, p. 1226~1235, 2019.

S. K. S, M. M, V. B. A, M. S. H, and C. K. V, “A brief survey of unsupervised agglomerative hierarchical clustering schemes,” International Journal of Engineering & Technology, vol. 8, no. 1, pp. 29–37, 2019.

S. Wu, J. Lin, Z. Zhang, and Y. Yang, “Hesitant Fuzzy Linguistic Agglomerative Hierarchical Clustering Algorithm and Its Application in Judicial Practice,” Mathematics, vol. 9, no. 4, p. 370, Feb. 2021, doi: 10.3390/math9040370.

I. G. N. M. Jaya and H. Folmer, “Identifying Spatiotemporal Clusters by Means of Agglomerative Hierarchical Clustering and Bayesian Regression Analysis with Spatiotemporally Varying Coefficients: Methodology and Application to Dengue Disease in Bandung, Indonesia,” Geogr Anal, vol. 53, no. 4, pp. 767–817, 2021, doi: 10.1111/gean.12264.

A. Naeem, M. Rehman, M. Anjum, and M. Asif, “Development of an efficient hierarchical clustering analysis using an agglomerative clustering algorithm,” CURRENT SCIENCE, vol. 117, no. 6, pp. 1045–1053, 2019.

M. R. Ridwan and H. Retnawati, “Application of Cluster Analysis Using Agglomerative Method,” Numerical: Jurnal Matematika dan Pendidikan Matematika, vol. 5, no. 1, pp. 33–48, 2021.

I. A. Mezinova, J. B. Amirkhanyan, O. V. Bodiagin, and M. M. Balanova, “The Relationship between the Country‘s Global Competitiveness and its National MNEs,” Visegrad Journal on Bioeconomy and Sustainable Development, vol. 8, no. 2, pp. 87–92, Nov. 2019, doi: 10.2478/vjbsd-2019-0017.

K. Pourahmadi, P. Nooralinejad, and H. Pirsiavash, “A Simple Baseline for Low-Budget Active Learning,” 2021, doi: 10.48550/ARXIV.2110.12033.

V.-C. Bulai, A. Horobeț, and L. Belascu, “Improving Local Governments’ Financial Sustainability by Using Open Government Data: An Application of High-Granularity Estimates of Personal Income Levels in Romania,” Sustainability, vol. 11, no. 20, p. 5632, Jan. 2019, doi: 10.3390/su11205632.

S. Babichev, S. Vyshemyrska, and V. Lytvynenko, “Implementation Of Dbscan Clustering Algorithm Within The Framework Of The Objective Clustering Inductive Technology Based On R And Knime Tools,” Radio Electronics, Computer Science, Control, vol. 0, no. 1, Apr. 2019, doi: 10.15588/1607-3274-2019-1-8.

X. Li, P. Zhang, and G. Zhu, “DBSCAN Clustering Algorithms for Non-Uniform Density Data and Its Application in Urban Rail Passenger Aggregation Distribution,” Energies, vol. 12, no. 19, p. 3722, Jan. 2019, doi: 10.3390/en12193722.

V. Martynenko, Y. Kovalenko, I. Chunytska, O. Paliukh, M. Skoryk, and I. Plets, “Fiscal Policy Effectiveness Assessment Based on Cluster Analysis of Regions,” International Journal of Computer Science and Network Security, vol. 22, no. 7, pp. 75–84, Jul. 2022, doi: 10.22937/IJCSNS.2022.22.7.10.

Z. Li, Y. Li, W. Lu, and J. Huang, “Crowdsourcing Logistics Pricing Optimization Model Based on DBSCAN Clustering Algorithm,” IEEE Access, pp. 1–1, 2020, doi: 10.1109/ACCESS.2020.2995063.

S.-S. Li, “An Improved DBSCAN Algorithm Based on the Neighbor Similarity and Fast Nearest Neighbor Query,” IEEE Access, vol. 8, pp. 47468–47476, 2020, doi: 10.1109/ACCESS.2020.2972034.

T. Wang, C. Ren, Y. Luo, and J. Tian, “NS-DBSCAN: A Density-Based Clustering Algorithm in Network Space,” ISPRS International Journal of Geo-Information, vol. 8, no. 5, p. 218, May 2019, doi: 10.3390/ijgi8050218.

S. Wibisono, M. T. Anwar, A. Supriyanto, and I. H. A. Amin, “Multivariate weather anomaly detection using DBSCAN clustering algorithm,” J. Phys.: Conf. Ser., vol. 1869, no. 1, p. 012077, Apr. 2021, doi: 10.1088/1742-6596/1869/1/012077.

N. A. Febriyati, A. D. GS, and A. Wanto, “GRDP Growth Rate Clustering in Surabaya City uses the K-Means Algorithm,” International Journal of Information System & Technology, vol. 3, no. 2, pp. 276–283, 2020.

A. Hidayah, “Implementing Data Clustering to Identify Capital Allocation for Implementing Data Clustering to Identify Capital Allocation for Small and Medium Sized Enterprises (SMEs) Small and Medium Sized Enterprises (SMEs),” ASEAN Marketing Journal, vol. X, no. 1, pp. 66–74, 2018, [Online]. Available: https://scholarhub.ui.ac.id/amj/vol10/iss1/5?utm_source = scholarhub.ui.ac.id%2Famj%2Fvol10%2Fiss1%2F5&utm_medium = PDF&utm_campaign = PDFCoverPages

R. Wulaningrum, V. E. Satya, M. Kadafi, D. Y. A. S. Fala, and A. Azizah, “Operating Cash Flow Analysis of Indonesian Provincial Government,” Mar. 2022, pp. 571–576. doi: 10.2991/assehr.k.220301.094.

X. Chao, G. Kou, Y. Peng, and E. H. Viedma, “Large-scale group decision-making with non-cooperative behaviors and heterogeneous preferences: An application in financial inclusion,” European Journal of Operational Research, vol. 288, no. 1, pp. 271–293, 2021, doi: 10.1016/j.ejor.2020.05.047.

C. De Lucia, P. Pazienza, and M. Bartlett, “Does Good ESG Lead to Better Financial Performances by Firms? Machine Learning and Logistic Regression Models of Public Enterprises in Europe,” Sustainability, vol. 12, no. 13, p. 5317, Jul. 2020, doi: 10.3390/su12135317.

C. Cicea, I. Popa, C. Marinescu, and S. C. Ștefan, “Determinants of SMEs’ performance: evidence from European countries,” Economic Research-Ekonomska Istraživanja, vol. 32, no. 1, pp. 1602–1620, Jan. 2019, doi: 10.1080/1331677X.2019.1636699.

P. Fränti and S. Sieranoja, “How much can k-means be improved by using better initialization and repeats?,” Pattern Recognition, vol. 93, pp. 95–112, 2019, doi: 10.1016/j.patcog.2019.04.014.

C. Yuan and H. Yang, “Research on K-Value Selection Method of K-Means Clustering Algorithm,” J, vol. 2, no. 2, pp. 226–235, Jun. 2019, doi: 10.3390/j2020016.

K. P. Sinaga and M.-S. Yang, “Unsupervised K-Means Clustering Algorithm,” IEEE Access, vol. 8, pp. 80716–80727, 2020, doi: 10.1109/ACCESS.2020.2988796.

S. Xia et al., “A Fast Adaptive k-means with No Bounds,” IEEE Trans. Pattern Anal. Mach. Intell., pp. 1–1, 2020, doi: 10.1109/TPAMI.2020.3008694.

H. Xie et al., “Improving K-means clustering with enhanced Firefly Algorithms,” Applied Soft Computing, vol. 84, p. 105763, 2019, doi: 10.1016/j.asoc.2019.105763