Clustering with Entropy-Like k-Means Algorithms
The aim of this chapter is to demonstrate that many results attributed to the classical k-means clustering algorithm with the squared Euclidean distance can be extended to many other distance-like functions. We focus on entropy-like distances based on Bregman  and Csiszar  divergences, which have previously been shown to be useful in various optimization and clustering contexts. Further, the chapter reviews various versions of the classical k-means and BIRCH clustering algorithms with squared Euclidean distance and considers modifications of these algorithms with the proposed families of distance-like functions. Numerical experiments with some of these modifications are reported.
KeywordsMalignant Pleural Mesothelioma Normalize Mutual Information Bregman Divergence Bregman Distance Batch Algorithm
Unable to display preview. Download preview PDF.