A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
Translation-invariant mixture models for curve clustering
2003
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '03
In this paper we present a family of algorithms that can simultaneously align and cluster sets of multidimensional curves defined on a discrete time grid. Our approach uses the Expectation-Maximization (EM) algorithm to recover both the mean curve shapes for each cluster, and the most likely shifts, offsets, and cluster memberships for each curve. We demonstrate how Bayesian estimation methods can improve the results for small sample sizes by enforcing smoothness in the cluster mean curves. We
doi:10.1145/956755.956763
fatcat:jgrxqckyi5eljhooai4kaesiee