International Peer-Reviewed Open Access Journal ISSN (Online): 2395-5325
IJCRCST Logo

International Journal of Contemporary Research in Computer Science and Technology

Peer Reviewed Open Access Fully Refereed Journal Since 2015
Download Full PDF
Article Information
  • Published In Volume 3, Issue 1 (2017)
  • Publication Date July 31, 2026
  • Manuscript ID IJCRCST-JANUARY17-12
  • Article Type Research Paper
  • Pages 48 - 51
  • 22 Views 0 Downloads

Abstract

Data clustering is a common technique for data analysis, which is used in many fields, including machine learning, data mining, pattern recognition, image analysis and bioinformatics. K-means is a simple and widely used algorithm for clustering data. But, the traditional k-means is computationally expensive; sensitive to outlier’s i.e. unnecessary data and produces unstable result hence it becomes inefficient when dealing with very large datasets. Solving these Issues is the subject of many recent research works. In this paper, we will do a review on k-means clustering algorithms.

Keywords

Big Data K-Means Clustering Map Reduce Datamining

Authors

K.M.Padmapriya
Dr. B.Anandhi
How to Cite this Article

K.M.Padmapriya, Dr. B.Anandhi (2017). "A REVIEW ON BIG DATA ANALYSIS AND K-MEANS CLUSTERING ALGORITHM USING PERFORMANCE OF GPU". International Journal of Contemporary Research in Computer Science and Technology, 3(1), pp. 48-51.