Journal of Computations & Modelling

Automatic K- Expectation Maximization (A K-EM) Algorithm for Data Mining Applications

  • Pdf Icon [ Download ]
  • Times downloaded: 9488
  • Abstract


    A non-parametric data clustering technique for achieving efficient data-clustering and improving the number of clusters is presented in this paper. K-Means and Expectation-Maximization algorithms have been widely deployed in data-clustering applications. Result findings in related works revealed that both these algorithms have been found to be characterized with shortcomings. K-Means does not guarantee convergence and the choice of clusters heavily influenced the results. Expectation-Maximizationís premature convergence does not assure the optimality of results and as with K-Means, the choice of clusters influence the results. To overcome the shortcomings, a fast automatic K-EM algorithm is developed which provides optimal number of clusters by employing various internal cluster validity metrics, thereby providing efficient and unbiased results. The algorithm is implemented on a wide array of data sets to ensure the accuracy of the results and efficiency of the algorithm.