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...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
MDPI AG
2019-08-01
|
| Schriftenreihe: | Algorithms |
| Schlagworte: | |
| Online-Zugang: | https://www.mdpi.com/1999-4893/12/9/177 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|