Skip to Main content Skip to Navigation
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.
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

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

File

448933_1_En_17_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

503

Files downloads

92