2018
DOI: 10.1007/s11634-018-0335-0
|View full text |Cite
|
Sign up to set email alerts
|

Greedy Gaussian segmentation of multivariate time series

Abstract: We consider the problem of breaking a multivariate (vector) time series into segments over which the data is well explained as independent samples from a Gaussian distribution. We formulate this as a covariance-regularized maximum likelihood problem, which can be reduced to a combinatorial optimization problem of searching over the possible breakpoints, or segment boundaries. This problem can be solved using dynamic programming, with complexity that grows with the square of the time series length. We propose a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
51
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 66 publications
(51 citation statements)
references
References 54 publications
0
51
0
Order By: Relevance
“…To achieve this representation, it is necessary to simultaneously segment and cluster the time series. This problem is more difficult than standard time series segmentation [17,20], since multiple segments can belong to the same cluster. However, it is also harder than subsequence clustering [3,43] because each data point cannot be clustered independently (since neighboring points are encouraged to belong to the same cluster).…”
Section: Introductionmentioning
confidence: 99%
“…To achieve this representation, it is necessary to simultaneously segment and cluster the time series. This problem is more difficult than standard time series segmentation [17,20], since multiple segments can belong to the same cluster. However, it is also harder than subsequence clustering [3,43] because each data point cannot be clustered independently (since neighboring points are encouraged to belong to the same cluster).…”
Section: Introductionmentioning
confidence: 99%
“…In point clustering methods, instead, each multivariate observation at each time instance t is assigned to a cluster. In most popular approaches, however, this is done based on a distance metric (Grabarnik and Särkkä 2001, Focardi and Fabozzi 2004, Zolhavarieh et al 2014, Hendricks et al 2016, Hallac et al 2016.…”
Section: Introductionmentioning
confidence: 99%
“…[15,16,17,11]. A more exhaustive and recent list of references can be found for instance in [18,19].…”
Section: Data-driven Based Segmentationmentioning
confidence: 99%