Unsupervised clustering of series using dynamic programming
Not on the map. Why?
Abstract (arXiv)
We are interested in clustering parts of a given single multi-variate series in an unsupervised manner. We would like to segment and cluster the series such that the resulting blocks present in each cluster are coherent with respect to a known model (e.g. physics model). Data points are said to be coherent if they can be described using this model with the same parameters. We have designed an algorithm based on dynamic programming with constraints on the number of clusters, the number of transitions as well as the minimal size of a block such that the clusters are coherent with this process. We present an use-case: clustering of petrophysical series using the Waxman-Smits equation.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 1 of its 9 references that are in the map. First posted on arXiv 23 Jan 2021.
Builds on
1 of 9 references.
References · 1
- 2019Attentive Neural Processescited by 283
Built on by
Not cited yet.