Scholars Central

Research articlePublished 2012

Entropy Based Mean Clustering: An Enhanced Clustering Approach

Authors: V.V. Jaya RamaKrishnaiah, K. Ramch, H Rao, R. Satya Prasad

Journal of Computer Science & Systems Biology

Volume 5 · Issue 3 · Pages 62–67

Ask about this article

Abstract

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

Many applications of clustering require the use of normalized data, such as text data or mass spectra mining data. The K –Means Clustering Algorithm is one of the most widely used clustering algorithm which works on greedy approach. Major problems with the traditional K mean clustering is generation of empty clusters and more computations required to make the group of clusters. To overcome this problem we proposed an Algorithm namely Entropy Based Means Clustering Algorithm. The proposed Algorithm produces normalized cluster centers, hence highly useful for text data or massive data. The proposed algorithm shows better performance when compared with traditional K Mean Clustering Algorithm in mining data in terms of reducing time, seed predications and avoiding Empty Clusters.

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:

Follow

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

  • JournalJournal of Computer Science & Systems Biology
  • SubjectComputer Science & IT
  • BylineArticles whose byline prints “V.V. Jaya RamaKrishnaiah”
  • BylineArticles whose byline prints “K. Ramch”
  • BylineArticles whose byline prints “H Rao”
  • BylineArticles whose byline prints “R. Satya Prasad”

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