%0 Conference Proceedings
%T Split-and-merge Tweak in Cross Entropy Clustering
%+ Uniwersytet Jagielloński w Krakowie = Jagiellonian University (UJ)
%A Hajto, Krzysztof
%A Kamieniecki, Konrad
%A Misztal, Krzysztof
%A Spurek, Przemysław
%Z Part 3: Data Analysis and Information Retrieval
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 16th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM)
%C Bialystok, Poland
%Y Khalid Saeed
%Y Władysław Homenda
%Y Rituparna Chaki
%I Springer International Publishing
%3 Computer Information Systems and Industrial Management
%V LNCS-10244
%P 193-204
%8 2017-06-16
%D 2017
%R 10.1007/978-3-319-59105-6_17
%K Cross entropy clustering
%K Clusters splitting
%K Clusters merging
%Z Computer Science [cs]
%Z Humanities and Social Sciences/Library and information sciencesConference papers
%X 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.
%G English
%Z TC 8
%2 https://inria.hal.science/hal-01656257/document
%2 https://inria.hal.science/hal-01656257/file/448933_1_En_17_Chapter.pdf
%L hal-01656257
%U https://inria.hal.science/hal-01656257
%~ SHS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC8
%~ IFIP-CISIM
%~ IFIP-LNCS-10244