A new EM algorithm for resource allocation network

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

Abstract

Clustering usually assumes that the number of clusters is known or given. No knowledge of such a priori information is needed to find an appropriate number of clusters. This paper introduces an elliptical clustering algorithm with incremental growth of clusters, which is derived from the batch EM algorithm with a decay factor and a novelty criterion. The proposed algorithm can start with no or a small number of clusters. Whenever unusual data is presented, the algorithm adds a new cluster and finally the number of clusters in the data is obtained after clustering. The usefulness of the proposed algorithm is demonstrated for texture image segmentation and skin image segmentation. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Lee, K. M. (2005). A new EM algorithm for resource allocation network. In Lecture Notes in Computer Science (Vol. 3686, pp. 355–362). Springer Verlag. https://doi.org/10.1007/11551188_38

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