论文信息 - Multivariate Clustering by Dynamics

Multivariate Clustering by Dynamics

We present a Bayesian clustering algorithm for multivariate time series. A clustering is regarded as a probabilistic model in which the unknown auto-correlation structure of a time series is approximated by a first order Markov Chain and the overall joint distribution of the variables is simplified by conditional independence assumptions. The algorithm searches for the most probable set of clusters given the data using a entropy-based heuristic search method. The algorithm is evaluated on a set of multivariate time series of propositions produced by the perceptual system of a mobile robot.

[1] Sheldon M. Ross,et al. Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[2] Padhraic Smyth,et al. Probabilistic Model-Based Clustering of Multivariate and Sequential Data , 1999 .

[3] Paul R. Cohen,et al. Unsupervised clustering of robot activities: a Bayesian approach , 2000, AGENTS '00.

[4] Paul R. Cohen,et al. Discovering Dynamics Using Bayesian Clustering , 1999, IDA.

[5] Lawrence R. Rabiner,et al. A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[6] Donald J. Berndt,et al. Finding Patterns in Time Series: A Dynamic Programming Approach , 1996, Advances in Knowledge Discovery and Data Mining.

[7] A. Raftery,et al. Model-based Gaussian and non-Gaussian clustering , 1993 .

[8] Padhraic Smyth,et al. Clustering Sequences with Hidden Markov Models , 1996, NIPS.

[9] Paul R. Cohen,et al. Learned models for continuous planning , 1999, AISTATS.

[10] Paul R. Cohen,et al. Bayesian Analysis of Sensory Inputs of a Mobile Robot , 2002 .