A Study of Various Methods to find K for K-Means Clustering
Hitesh Chandra Mahawari1 , Mahesh Pawar2
Section:Review Paper, Product Type: Journal Paper
Volume-4 ,
Issue-3 , Page no. 45-47, Mar-2016
Online published on Mar 30, 2016
Copyright © Hitesh Chandra Mahawari , Mahesh Pawar . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
View this paper at Google Scholar | DPI Digital Library
How to Cite this Paper
- IEEE Citation
- MLA Citation
- APA Citation
- BibTex Citation
- RIS Citation
IEEE Style Citation: Hitesh Chandra Mahawari , Mahesh Pawar , “A Study of Various Methods to find K for K-Means Clustering,” International Journal of Computer Sciences and Engineering, Vol.4, Issue.3, pp.45-47, 2016.
MLA Style Citation: Hitesh Chandra Mahawari , Mahesh Pawar "A Study of Various Methods to find K for K-Means Clustering." International Journal of Computer Sciences and Engineering 4.3 (2016): 45-47.
APA Style Citation: Hitesh Chandra Mahawari , Mahesh Pawar , (2016). A Study of Various Methods to find K for K-Means Clustering. International Journal of Computer Sciences and Engineering, 4(3), 45-47.
BibTex Style Citation:
@article{Mahawari_2016,
author = {Hitesh Chandra Mahawari , Mahesh Pawar },
title = {A Study of Various Methods to find K for K-Means Clustering},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {3 2016},
volume = {4},
Issue = {3},
month = {3},
year = {2016},
issn = {2347-2693},
pages = {45-47},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=825},
publisher = {IJCSE, Indore, INDIA},
}
RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=825
TI - A Study of Various Methods to find K for K-Means Clustering
T2 - International Journal of Computer Sciences and Engineering
AU - Hitesh Chandra Mahawari , Mahesh Pawar
PY - 2016
DA - 2016/03/30
PB - IJCSE, Indore, INDIA
SP - 45-47
IS - 3
VL - 4
SN - 2347-2693
ER -
VIEWS | XML | |
1876 | 1647 downloads | 1535 downloads |
Abstract
Clustering is the technique which used to group data from a set of unlabeled data, in a way that data containing similar properties contains in a same group. There are many cluster techniques are used to cluster data thus there is no suitable definition for cluster is available. Techniques like link based clustering, centroid based clustering, distribution based clustering, density based clustering are used. A survey over centroid based K-mean clustering techniques is presented which is widely used for clustering purpose. K-mean clustering technique suffers drawbacks like sensitive to initialization centroid, sensitive to noise, and there is no. of clusters also not defined. Thus an enhanced k-mean technique is presented to reduce such drawbacks and provide an enhanced functionality for clustering.
Key-Words / Index Term
K-Means, Clustering, Centroid, Centroid based clustering, partition based clustering, point based, convex, euclidian
References
[1] Madhu Yedla, Srinivasa Rao Pathakota, and T M Srinivasa, "Enhancing K-means Clustering Algorithm with Improved Initial Center," in IJCSIT, 2010.
[2] Boris Mirkin Mark Ming-Tso Chiang, "Intelligent Choice of the Number of Clusters in K-Means Clustering: An Experimental Study with Different Cluster Spreads," journal of classification, 2009.
[3] S S Dimov, and C D Nguyen D T Pham, "Selection of K in K-means clustering ," IMechE 2005.
[4] Naveen D Chandavarkar Uday Kumar S, "A Survey on Several Technical Methods for Selecting Initial Cluster Centers in K-Means Clustering Algorithm," IJARCSSE, Dec 2014.
[5] David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu Tapas Kanungo, "An Efficient k-Means Clustering Algorithm: Analysis and Implementation," IEEE.
[6] Rebecca J. Passonneau, Austin Lee, Axinia Radeva, Boyi Xie And David Waltz Haimonti Dutta, "Learning Parameters Of The K-Means Algorithm, From Subjective Human Annotation," in Association for the Advancement of Artificial Intelligence, 2011.
[7] H.J. Mucha, "Adaptive cluster analysis, classification and multivariate graphics," Weirstrass Institute for Applied Analysis and Stochastics, 1992.
[8] N.V. Anand Kumar and G. V. Uma, "Improving Academic Performance of Students by Applying Data Mining Technique," European Journal of Scientific Research, vol. 34, 2009.
[9] Navjot Kaur Manjot Kaur, "Web Document Clustering Approaches Using K-Means Algorithm," IJARCSSE, 2013.
[10] Marian Cristian Mihaescu, Mihai Mocanu Cosmin Marian Poteras, "An Optimized Version of the K-Means Clustering Algorithm," in IEEE, 2014.
[11] O.O. Oladipupo, I.C Obagbuwa O.J. Oyelade, "Application of k-Means Clustering algorithm for prediction of Students’ Academic Performance," IJCSIS, 2010.
[12] A. Jamshidzadeh , M. Saadatseresht , S. Homayouni A. Alizade Naeini, "An Efficient Initialization Method For K-Means Clustering Of Hyper spectral Data," ISPRS, Nov 2014.
[13] Zhiyi Fang Chunfei Zhang, "An Improved K-means Clustering Algorithm," in JICS, 2013.
[14] Wenbin, Yang,Yan &Qu Wu, "Interactive visual summary of major communities in a large network," in Pacific Visualization Symposium, Hangzhou,China, 2015, pp. 47-54.