Simple K-Medoids Partitioning Algorithm for Mixed Variable Data
A simple and fast k-medoids algorithm that updates medoids by minimizing the total distance within clusters has been developed. Although it is simple and fast, as its name suggests, it nonetheless has neglected local optima and empty clusters that may arise. With the distance as an input to the algo...
Main Authors: | Weksi Budiaji, Friedrich Leisch |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-08-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/12/9/177 |
Similar Items
-
Pengelompokan Wilayah Madura Berdasar Indikator Pemerataan Pendidikan Menggunakan Partition Around Medoids Dan Validasi Adjusted Random Index
by: Budi Dwi Satoto, et al.
Published: (2015-04-01) -
Two Medoid-Based Algorithms for Clustering Sets
by: Libero Nigro, et al.
Published: (2023-07-01) -
Cluster Analysis with K-Mean versus K-Medoid in Financial Performance Evaluation
by: Emilia Herman, et al.
Published: (2022-08-01) -
Perbandingan Algoritma K-Means dan K-Medoids Dalam Penclusteran Data Penjualan PT. United Teknologi Integrasi
by: Agung Lesmana, et al.
Published: (2022-08-01) -
OTOMATISASI KLASIFIKASI BUKU PERPUSTAKAAN DENGAN MENGGABUNGKAN METODE K-NN DENGAN K-MEDOIDS
by: Ni Nyoman Emang Smrti
Published: (2015-11-01)