Clustering spherical shells by a mini-max information algorithm

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We focus on spherical shells clustering by a mini-max information (MMI) clustering algorithm based on mini-max optimization of mutual information (MI). The minimization optimization leads to a mass constrained deterministic annealing (DA) approach, which is independent of the choice of the initial data configuration and has the ability to avoid poor local optima. The maximization optimization provides a robust estimation of probability soft margin to phase out outliers. Furthermore, a novel cluster validity criteria is estimated to determine an optimal cluster number of spherical shells for a given set of data. The effectiveness of MMI algorithm for clustering spherical shells is demonstrated by experimental results. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Yang, X., Song, Q., Zhang, W., & Wang, Z. (2006). Clustering spherical shells by a mini-max information algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3852 LNCS, pp. 224–233). Springer Verlag. https://doi.org/10.1007/11612704_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free