Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Jurnal Algoritma
Hermina
Institut Informatika dan Bisnis Darmajaya
Computer Science & IT

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

Found 1 Documents
Search

 1 
K-Means Clustering Menghasilkan Tiga Segmen Layanan Sertifikasi Kapal Berbasis Karakteristik Operasional Hermina; Handoyo Widi Nugroho
Jurnal Algoritma Vol 23 No 1 (2026): Jurnal Algoritma
Publisher : Institut Teknologi Garut

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33364/algoritma/v.23-1.3486

Abstract

Uneven workload distribution in ship certification services is a major operational challenge for port authorities. This study applies K-Means Clustering to 18 types of certification services at KSOP Class I Panjang, involving 1,506 certificates issued from January to December 2025, using four operational variables: application frequency, completion time, number of documents, and service complexity. The Elbow Method identified K = 3 as the optimal number of clusters. Three groups were formed: Regular Services, consisting of 6 low-complexity services; Complex Services, consisting of 10 services with high technical requirements; and Dominant Services, consisting of 2 services that accounted for 62.4 percent of total certificate issuance. Cluster quality was confirmed by a Silhouette Score of 0.6221 and a Davies-Bouldin Index of 0.484. These findings contribute methodologically by demonstrating that service population-based segmentation produces valid clusters that can be directly applied as a basis for human resource reallocation, digitalization prioritization, and the formation of specialist teams within port authorities.
Co-Authors handoyo widi nugroho