Now showing items 1-2 of 2
Improving Bregman k-means
(Inderscience Publishers Ltd, 2014)
We review Bregman divergences and use them in clustering algorithms which we have previously developed to overcome one of the difficulties of the standard k-means algorithm which is its sensitivity to initial conditions ...
A novel construction of connectivity graphs for clustering and visualization
(World Scientific and Engineering Academy and Society (WSEAS), 2008)
We [5, 6] have recently investigated several families of clustering algorithms. In this paper, we show how a novel similarity function can be integrated into one of our algorithms as a method of performing clustering and ...