An Integrated Graph and Probability Based Clustering Framework for Sequential Data

  • Authors:
  • Haytham Elghazel;Tetsuya Yoshida;Mohand-Said Hacid

  • Affiliations:
  • Université/ de Lyon, Lyon, F-69003, France / université/ Lyon 1, EA4125, LIESP, Villeurbanne, France F-69622;Grad. School of Information Science and Technology, Hokkaido University, Sapporo, Japan 060-0814;Université/ de Lyon, Lyon, F-69003, France/ université/ Lyon 1, CNRS UMR5205, LIRIS, Villeurbanne, France F-69622

  • Venue:
  • DS '08 Proceedings of the 11th International Conference on Discovery Science
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes a new integrated sequential data clustering framework based on an iterative process which alternates between the EM process and a modified b-coloring clustering algorithm. It exhibits two important features: Firstly, the proposed framework allows to give an assignment of clusters to the sequences where the b-coloring properties are maintained as long as the clustering process runs. Secondly, it gives each cluster a twofold representation by a generative model (Markov chains) as well as dominant members which ensure the global stability of the returned partition. The proposed framework is evaluated against benchmark datasets in UCI repository and its effectiveness is confirmed.