Comparative Analysis of K-Means and Fuzzy C-Means Algorithms

Abstract

In the arena of software, data mining technology has been considered as useful means for identifying patterns and trends of large volume of data. This approach is basically used to extract the unknown pattern from the large set of data for business as well as real time applications. It is a computational intelligence discipline which has emerged as a valuable tool for data analysis, new knowledge discovery and autonomous decision making. The raw, unlabeled data from the large volume of dataset can be classified initially in an unsupervised fashion by using cluster analysis i.e. clustering the assignment of a set of observations into clusters so that observations in the same cluster may be in some sense be treated as similar. The outcome of the clustering process and efficiency of its domain application are generally determined through algorithms. There are various algorithms which are used to solve this problem. In this research work two important clustering algorithms namely centroid based K-Means and representative object based FCM (Fuzzy C-Means) clustering algorithms are compared. These algorithms are applied and performance is evaluated on the basis of the efficiency of clustering output. The numbers of data points as well as the number of clusters are the factors upon which the behaviour patterns of both the algorithms are analyzed. FCM produces close results to K-Means clustering but it still requires more computation time than K-Means clustering.

Authors and Affiliations

Soumi Ghosh, Sanjay Dubey

Keywords

Related Articles

Research on Energy Saving Method for IDC CRAC System based on Prediction of Temperature

Amid the information era, energy consumption of IDC Computer Room Air Conditioning (CRAC) system is becoming increasingly serious. Thus there is growing concern over energy saving and consumption reduction. Based on the...

QUATERNIONIC WIGNER-VILLE DISTRIBUTION OF ANALYTICAL SIGNAL IN HYPERSPECTRAL IMAGERY

The 2D Quaternionic Fourier Transform (QFT), applied to a real 2D image, produces an invertible quaternionic spectrum. If we conserve uniquely the first quadrant of this spectrum, it is possible, after inverse transforma...

Efficient Distributed SPARQL Queries on Apache Spark

RDF is a widely-accepted framework for describing metadata in the web due to its simplicity and universal graph-like data model. Owing to the abundance of RDF data, existing query techniques are rendered unsuitable. To t...

Supporting Self-Organization with Logical-Clustering Towards Autonomic Management of Internet-of-Things

One of the challenges for autonomic management in Future Internet is to bring about self-organization in a rapidly changing environment and enable participating nodes to be aware and respond to changes. The massive numbe...

A Game Theoretic Approach to Demand Side Management in Smart Grid with Multiple Energy Sources and Storage

A smart grid is an advancement in electrical grid which includes a variety of operational and energy measures. To utilize energy distribution in an efficient manner, demand side management has become the fore-runner. In ou...

Download PDF file
  • EP ID EP156623
  • DOI 10.14569/IJACSA.2013.040406
  • Views 108
  • Downloads 0

How To Cite

Soumi Ghosh, Sanjay Dubey (2013). Comparative Analysis of K-Means and Fuzzy C-Means Algorithms. International Journal of Advanced Computer Science & Applications, 4(4), 35-39. https://europub.co.uk/articles/-A-156623