Initializing KMeans Clustering Algorithm using Statistical Information

  • F. Eltibi M
  • M. Ashour W
N/ACitations
Citations of this article
34Readers
Mendeley users who have this article in their library.

Abstract

K-means clustering algorithm is one of the best known algorithms used in clustering; nevertheless it has many disadvantages as it may converge to a local optimum, depending on its random initialization of prototypes. We will propose an enhancement to the initialization process of k-means, which depends on using statistical information from the data set to initialize the prototypes. We show that our algorithm gives valid clusters, and that it decreases error and time.

Cite

CITATION STYLE

APA

F. Eltibi, M., & M. Ashour, W. (2011). Initializing KMeans Clustering Algorithm using Statistical Information. International Journal of Computer Applications, 29(7), 51–55. https://doi.org/10.5120/3573-4930

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