Factors influencing K means algorithm Online publication date: Sat, 26-Jul-2014
by Shejuti Khan; S.M. Monzurur Rahman; M. Faysal Tanim; Fizar Ahmed
International Journal of Computational Systems Engineering (IJCSYSE), Vol. 1, No. 4, 2013
Abstract: Clustering is an unsupervised learning technique. K-means is one of the most popular clustering algorithms. K-means requires the number of clusters to be pre-specified. Finding the appropriate number of clusters for a dataset is a trial-and-error process made more difficult by the subjective nature of deciding what constitutes 'correct' clustering (Han and Kamber, 2000). The aim of K-means is to group the items into k clusters such that all items in same cluster are as similar to each other and items not in same cluster are as dissimilar as possible. Different distance measures can be applied to calculate similarity. Improving the performance of K means can be a very useful and make better clustering. Improvement of performance depends on factors which we need to explore and measure with experiments. Our paper has done this and studied and identified five influential factors for the performance improvement of K-means.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Systems Engineering (IJCSYSE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook