|
|
|
|
|
Weksi Budiaji and Friedrich Leisch
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 ar...
ver más
|
|
|
|
|