| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Split-and-merge Tweak in Cross Entropy Clustering
Abstract : 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.
Cited literature [15 references]
https://hal.inria.fr/hal-01656257
Contributor : Hal Ifip <>
Submitted on : Tuesday, December 5, 2017 - 2:59:27 PM
Last modification on : Wednesday, December 6, 2017 - 1:20:58 AM
Contributor : Hal Ifip <>
Submitted on : Tuesday, December 5, 2017 - 2:59:27 PM
Last modification on : Wednesday, December 6, 2017 - 1:20:58 AM
File
448933_1_En_17_Chapter.pdf
Files produced by the author(s)
Licence
Distributed under a Creative Commons Attribution 4.0 International License