Adi Wibowo
Universitas Diponegoro, Tembalang, Semarang, 50275, Indonesia

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

Found 1 Documents
Search

K-Means Clustering Algorithm for Partitioning the Openness Levels of Open Government Data Portals Emigawaty Emigawaty; Kusworo Adi; Adian Fatchur Rochim; Budi Warsito; Adi Wibowo
JOIV : International Journal on Informatics Visualization Vol 7, No 3 (2023)
Publisher : Politeknik Negeri Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30630/joiv.7.3.1761

Abstract

More and more local governments in Indonesia are making their data available to the public. This benefits data scientists, researchers, business owners, and other potential users seeking datasets for empirical research and business innovation. However, just because Open Government Data (OGD) portals are accessible does not mean that they necessarily adhere to the established rules and principles of data openness. To evaluate the level of openness of 24 OGD portals in Indonesia, this study used the K-means Clustering algorithm to partition them into three levels: Leaders, Followers, and Beginners. A group of 30 participants, including researchers, data scientists, business enablers, and graduate students, rated the portals on 32 sub-questions related to the eight main principles of data disclosure, focusing on health, population, and education datasets. The study found that eight portals were categorized as Leaders, ten as Followers, and seven as Beginners regarding their level of openness. The study demonstrated that the K-means Clustering algorithm can be effectively used to assess the degree of openness of OGD portals in Indonesia based on eight main principles of data openness. The study recommends increasing the number of OGD portals in eastern territories to supplement the existing case studies in the western and central regions.