A dynamic data granulation through adjustable fuzzy clustering

  • Authors:
  • Witold Pedrycz

  • Affiliations:
  • Department of Electrical and Computer Engineering, University of Alberta, Edmonton, Canada AB T6R 2G7 and System Research Institute, Polish Academy of Sciences, Warsaw, Poland

  • Venue:
  • Pattern Recognition Letters
  • Year:
  • 2008

Quantified Score

Hi-index 0.10

Visualization

Abstract

In this study, we develop a concept of dynamic data granulation realized in presence of incoming data organized in the form of so-called data snapshots. For each of these snapshots we reveal a structure by running fuzzy clustering. The proposed algorithm of adjustable fuzzy C-means (FCM) exhibits a number of useful features which directly associate with the dynamic nature of the underlying data: (a) the number of clusters is adjusted from one data snapshot to another in order to capture the varying structure of patterns and its complexity, (b) continuity between the consecutively discovered structures is retained, viz the clusters formed for a certain data snapshot are constructed as a result of evolving the clusters discovered in the predeceasing snapshot. We present a detailed clustering algorithm in which the mechanisms of adjustment of information granularity (the number of clusters) become the result of solutions to well-defined optimization tasks. The cluster splitting is guided by conditional fuzzy C-means (FCM) while cluster merging involves two neighboring prototypes. The criterion used to control the level of information granularity throughout the process is guided by a reconstruction criterion which quantifies an error resulting from pattern granulation and de-granulation. Numeric experiments provide a suitable illustration of the approach.