AN EFFECTIVE FRAMEWORK FOR DATA CLUSTERING USING IMPROVED K-MEANS APPROACH

Article Sidebar

PDF
Published: Apr 20, 2018
DOI: https://doi.org/10.26483/ijarcs.v9i2.5806
Keywords:
clustering, Dimensionality reduction, Modified k-means, outliers, redundancy, Iris

Main Article Content

Sakshi Siva Ramakrishna
ACHARYA NAGARJUNA UNIVERSITY GUNTUR ANDHRAPRADESH
ANURADHA TALASILA
JKC college Guntur Andhra pradesh

Abstract

Abstract: Data clustering refers to the partition of a dataset into homogeneous subsets where each subset is dissimilar to the rest of the subsets. K-means is a familiar approach for data clustering particularly when all the attributes of the data objects are of numeric type. Though the k-means approach is popular and efficient it is susceptible to misclassify the data due to the noise and outliers that are common in datasets. The aim of this paper is to study the strategies available to overcome the problems like high dimensionality, redundancy, noise and outliers while implementing the k-means algorithm and to propose a better approach to deal with the problem. An iterative attribute reduction procedure based on correlations among attributes was proposed to cluster the given dataset using k-means algorithm in an improved manner. The standard dataset “Iris†was used to test the proposed methodology. The obtained results are reasonably better.

Downloads

Download data is not yet available.

Article Details

Issue
Vol. 9 No. 2 (2018): March-April 2018
Section
Articles

COPYRIGHT

Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
  • The journal allows the author(s) to retain publishing rights without restrictions.
  • The journal allows the author(s) to hold the copyright without restrictions.
Author Biographies

Sakshi Siva Ramakrishna, ACHARYA NAGARJUNA UNIVERSITY GUNTUR ANDHRAPRADESH

COMPUTER SCIENCE AND ENGINEERING

ANURADHA TALASILA, JKC college Guntur Andhra pradesh

computer science and elecrtonics

References

. Jianpeng Qi, Yanwei Yu, LihongWang, Jinglei Liu and YingjieWang,“An effective and efficient hierarchical K-means clustering algorithmâ€, International Journal of Distributed Sensor Networks 2017, Vol. 13(8).

. Jiawei Han, Micheline Kamber and Jian Pei “Data Mining: Concepts and Techniquesâ€, 3rd edition. The Morgan Kaufmann Series in Data Management Systems Morgan Kaufmann Publishers, July 2011. ISBN 978-0123814791.

. Kalpana D. Joshi et al, “Modified K-Means for Better Initial Cluster Centers “International Journal of Computer Science and Mobile Computing Vol.2 Issue. 7, July- 2013, pg. 219-223.

. Sohrab Mahmud Md, Mostafizer Rahman Md., Nasim Akhtar Md., “Improvement of K-means Clustering algorithm with better initial centroids based on weighted averageâ€, 7th International Conference on Electrical and Computer Engineering, 2012, pp. 647-650.

. Vaishali Rajeev Patel, Rupa G. Mehta,“Performance Analysis of MK-means Clustering Algorithm with Normalization Approachâ€, World Congress on Information and Communication Technologies, 2011, pp. 974-979.

. Wang Shunye, “An improved k-means clustering algorithm based on dissimilarityâ€, Proceedings 2013 International Conference on Mechatronic Sciences, Electric Engineering and Computer (MEC) Year: 2013 Pages: 2629 – 2633.

. Zhang Chen, Xia Shixiong, “K-means Clustering Algorithm with improved Initial Centerâ€, Second International Workshop on Knowledge Discovery and Data Mining,2009, pp. 790-792.