Verzelen - Clustering with the relaxed K-means
Verzelen
Nicolas
This talk is devoted to clustering problems. It amounts to partitionning a set of given points or the nodes of a given graph, in such a way that the groups are as homogeneous as possible. After