An Integrated Graph and Probability Based Clustering Framework for Sequential Data - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

An Integrated Graph and Probability Based Clustering Framework for Sequential Data

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.

Dates and versions

hal-01586855 , version 1 (13-09-2017)

Identifiers

Cite

Haytham Elghazel, Tetsuya Yoshida, Mohand-Said Hacid. An Integrated Graph and Probability Based Clustering Framework for Sequential Data. 11th International Conference on Discovery Science, Oct 2008, Budapest, Hungary. pp.246-258, ⟨10.1007/978-3-540-88411-8_24⟩. ⟨hal-01586855⟩
69 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More