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

Towards Domain Ontology Creation Based on a Taxonomy Structure in Computer Vision

In computer vision to create a knowledge base usable by information systems, we need a data structure facilitating the information access. Artificial intelligence community uses the ontologies to structure and represent...

The Fir Digital Filter Design based on Iwpso

The essence of finite impulse response (FIR) digital filter design is the problem of the parameter optimization. Namely the optimal parameters of FIR digital filter are the core of the design. In due to the traditional d...

A Smart Under-Frequency Load Shedding Scheme based on Takagi-Sugeno Fuzzy Inference System and Flexible Load Priority

This paper proposes a new smart under frequency load shedding (UFLS) scheme, based on Takagi-Sugeno (TS) fuzzy inference system and flexible load priority. The proposed scheme consists of two parts. First part consists o...

Corporate Responsibility in Combating Online Misinformation

In the age of mass information and misinformation, the corporate duty of developers of browsers, social media, and search engines are falling short of the minimum standards of responsibility. The tools and technologies a...

Ontology Based SMS Controller for Smart Phones

Text analysis includes lexical analysis of the text and has been widely studied and used in diverse applications. In the last decade, researchers have proposed many efficient solutions to analyze / classify large text da...

Download PDF file
  • EP ID EP156623
  • DOI 10.14569/IJACSA.2013.040406
  • Views 79
  • 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