The fuzzy mega-cluster: Robustifying FCM by scaling down memberships

Amit Banerjee, Rajesh N. Dave

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

A new robust clustering scheme based on fuzzy c-means is proposed and the concept of a fuzzy mega-cluster is introduced in this paper. The fuzzy mega-cluster is conceptually similar to the noise cluster, designed to group outliers in a separate cluster. This proposed scheme, called the mega-clustering algorithm is shown to be robust against outliers. Another interesting property is its ability to distinguish between true outliers and non-outliers (vectors that are neither part of any particular cluster nor can be considered true noise). Robustness is achieved by scaling down the fuzzy memberships, as generated by FCM so that the infamous unity constraint of FCM is relaxed with the intensity of scaling differing across datum. The mega-clustering algorithm is tested on noisy data sets from literature and the results presented.

Original languageEnglish (US)
Pages (from-to)444-453
Number of pages10
JournalLecture Notes in Computer Science
Volume3613
Issue numberPART I
StatePublished - 2005

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'The fuzzy mega-cluster: Robustifying FCM by scaling down memberships'. Together they form a unique fingerprint.

Cite this