Scholars Central

Research articlePublished 2011

On Initialization of the Expectation maximization Clustering Algorithm

Authors: Z. Volkovich, R. Avros, M. Golani

Global Journal of Technology and Optimization

Volume 2 · Issue 2 · Pages 1–4

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

Iterative clustering algorithms commonly do not lead to optimal cluster solutions. Partitions that are generated by these algorithms are known to be sensitive to the initial partitions that are fed as an input parameter. A “good” selection of initial partitions is an essential clustering problem. In this paper we introduce a new method for constructing the initial partitions set to be used by the Expectation-Maximization clustering algorithm (EM algorithm). Our approach follows ideas from the Cross- Entropy method. We use a sample clustering provided by means of the EM algorithm as an alternative for the simulation phase of the Cross-Entropy method. Experimental results reflect a good performance with respect to the offered method.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Global Journal of Technology and Optimization.

All its articles

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalGlobal Journal of Technology and Optimization
  • SubjectComputer Science & IT
  • BylineArticles whose byline prints “Z. Volkovich”
  • BylineArticles whose byline prints “R. Avros”
  • BylineArticles whose byline prints “M. Golani”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels