By Topic

Study and analysis of temporal data using Hidden Markov models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ghidouche, K. ; Univ. A. MIRA de Bejaia, Béjaia, Algeria ; Kechadi, T. ; Tari, A.K.

In this paper we have developed a method for dividing a set of temporal data into clusters by using Hidden Markov Models. Given a number of clusters, each cluster is represented by one Hidden Markov Model. In order to determine the optimal number of clusters and the consistency of their structures, this approach defines an objective function based on the calculation of likelihood. The algorithm is presented in terms of four nested levels of searches: (1) the search for the optimal number of clusters in a partition, (2) the search for the optimal structure for a given partition, (3) the search for the optimal HMM structure for each cluster, and (4) the search for the optimal HMM parameters for each HMM. Preliminary results are given to support the proposed methodology.

Published in:

Spatial Data Mining and Geographical Knowledge Services (ICSDM), 2011 IEEE International Conference on

Date of Conference:

June 29 2011-July 1 2011