%0 Journal Article
	%A S. Deelers and  S. Auwatanamongkol
	%D 2007
	%J International Journal of Physical and Mathematical Sciences
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 11, 2007
	%T Enhancing K-Means Algorithm with Initial Cluster Centers Derived from Data Partitioning along the Data Axis with the Highest Variance
	%U https://publications.waset.org/pdf/4854
	%V 11
	%X In this paper, we propose an algorithm to compute
initial cluster centers for K-means clustering. Data in a cell is
partitioned using a cutting plane that divides cell in two smaller cells.
The plane is perpendicular to the data axis with the highest variance
and is designed to reduce the sum squared errors of the two cells as
much as possible, while at the same time keep the two cells far apart
as possible. Cells are partitioned one at a time until the number of
cells equals to the predefined number of clusters, K. The centers of
the K cells become the initial cluster centers for K-means. The
experimental results suggest that the proposed algorithm is effective,
converge to better clustering results than those of the random
initialization method. The research also indicated the proposed
algorithm would greatly improve the likelihood of every cluster
containing some data in it.
	%P 518 - 523