|
|
|
|
|
Frank Klawonn and Georg Hoffmann
Clustering algorithms are usually iterative procedures. In particular, when the clustering algorithm aims to optimise an objective function like in k-means clustering or Gaussian mixture models, iterative heuristics are required due to the high non-linea...
ver más
|
|
|
|
|