Evidential evolving Gustafson--Kessel algorithm for online data streams partitioning using belief function theory

  • Authors:
  • Lisa Serir;Emmanuel Ramasso;Noureddine Zerhouni

  • Affiliations:
  • FEMTO-ST Institute, UMR CNRS 6174-UFC/ENSMM/UTBM, Automatic Control and Micro-Mechatronic Systems Dep., 24 Rue Alain Savary, 25000 Besançon, France;FEMTO-ST Institute, UMR CNRS 6174-UFC/ENSMM/UTBM, Automatic Control and Micro-Mechatronic Systems Dep., 24 Rue Alain Savary, 25000 Besançon, France;FEMTO-ST Institute, UMR CNRS 6174-UFC/ENSMM/UTBM, Automatic Control and Micro-Mechatronic Systems Dep., 24 Rue Alain Savary, 25000 Besançon, France

  • Venue:
  • International Journal of Approximate Reasoning
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new online clustering method called E2GK (Evidential Evolving Gustafson-Kessel) is introduced. This partitional clustering algorithm is based on the concept of credal partition defined in the theoretical framework of belief functions. A credal partition is derived online by applying an algorithm resulting from the adaptation of the Evolving Gustafson-Kessel (EGK) algorithm. Online partitioning of data streams is then possible with a meaningful interpretation of the data structure. A comparative study with the original online procedure shows that E2GK outperforms EGK on different entry data sets. To show the performance of E2GK, several experiments have been conducted on synthetic data sets as well as on data collected from a real application problem. A study of parameters' sensitivity is also carried out and solutions are proposed to limit complexity issues.