Penerapan Metode Clustering Large Applications (CLARA) untuk Optimasi Matching Problem Pada Ridesharing dengan Memaksimumkan Total Adjusted Distance Proximity (ADP) Index = Application of Clustering Large Applications (CLARA) Method for Matching Problem Optimization on Ridesharing with Maximizing Total Adjusted Distance Proximity (ADP) Index

Penggunaan Density-Based Spatial Clustering of Application with Noise Untuk Optimasi Matching Problem pada Ridesharing dengan Memaksimumkan Total Distance Proximity Index = Application of Density-Based Spatial Clustering of Application with Noise to Optimize Matching Problems in Ridesharing for Maximize Total Distance Proximity Index.

Penggunaan Mean-Shift Clustering untuk Optimasi Matching Problem pada Ridesharing dengan Memaksimumkan Banyaknya Pasangan yang Terjadi (MATCH) = Application of Mean Shift Clustering to Optimize Matching Problem in Ridesharing for Maximize the Total Number of Matching (NM)

Perbandingan kinerja algoritma agglomerative hierarchical pada document clustering

Optimasi Rute Pengiriman Barang pada Tahap Last-Mile dengan Sistem Truck-Drone Menggunakan Hierarchical Aglomerative Clustering dan Tabu Search = Optimizing Goods Delivery Routes at the Last-Mile Stage with a Truck-Drone System Using Hierarchical Agglomerative Clustering and Tabu Search.