Split-and-merge Tweak in Cross Entropy Clustering - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Split-and-merge Tweak in Cross Entropy Clustering


In order to solve the local convergence problem of the Cross Entropy Clustering algorithm, a split-and-merge operation is introduced to escape from local minima and reach a better solution. We describe the theoretical aspects of the method in a limited space, present a few strategies of tweaking the clustering algorithm and compare them with existing solutions. The experiments show that the presented approach increases flexibility and effectiveness of the whole algorithm.
Fichier principal
Vignette du fichier
448933_1_En_17_Chapter.pdf (1.69 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01656257 , version 1 (05-12-2017)





Krzysztof Hajto, Konrad Kamieniecki, Krzysztof Misztal, Przemysław Spurek. Split-and-merge Tweak in Cross Entropy Clustering. 16th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Jun 2017, Bialystok, Poland. pp.193-204, ⟨10.1007/978-3-319-59105-6_17⟩. ⟨hal-01656257⟩
254 View
92 Download



Gmail Facebook X LinkedIn More