Hierarchical clustering of dynamical systems based on eigenvalue constraints

4Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper addresses the clustering problem of hidden dynamical systems behind observed multivariate sequences by assuming an interval-based temporal structure in the sequences. Hybrid dynamical systems that have transition mechanisms between multiple linear dynamical systems have become common models to generate and analyze complex time-varying event. Although the system is a flexible model for human motion and behaviors, the parameter estimation problem of the system has a paradoxical nature: temporal segmentation and system identification should be solved simultaneously. The EM algorithm is a well-known method that solves this kind of paradoxical problem; however the method strongly depends on initial values and often converges to a local optimum. To overcome the problem, we propose a hierarchical clustering method of linear dynamical systems by constraining eigenvalues of the systems. Due to the constraints, the method enables parameter estimation of dynamical systems from a small amount of training data, and provides well-behaved initial parameters for the EM algorithm. Experimental results on simulated and real data show the method can organize hidden dynamical systems successfully. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Kawashima, H., & Matsuyama, T. (2005). Hierarchical clustering of dynamical systems based on eigenvalue constraints. In Lecture Notes in Computer Science (Vol. 3686, pp. 229–238). Springer Verlag. https://doi.org/10.1007/11551188_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free