A pruned dynamic programming algorithm to recover the best segmentations with 1 to \(K_{\max}\) change-points (Q106351)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A pruned dynamic programming algorithm to recover the best segmentations with 1 to K_ change-points |
scientific article; zbMATH DE number 6576366
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A pruned dynamic programming algorithm to recover the best segmentations with 1 to \(K_{\max}\) change-points |
scientific article; zbMATH DE number 6576366 |
Statements
6 April 2010
0 references
2 May 2016
0 references
stat.CO
0 references
multiple-change-point detection
0 references
dynamic programming
0 references
functional cost
0 references
segment neighbourhood
0 references
A pruned dynamic programming algorithm to recover the best segmentations with 1 to \(K_{\max}\) change-points (English)
0 references
0.848587155342102
0 references
0.812969982624054
0 references
0.7756608128547668
0 references
0.7491822838783264
0 references
0.7477945685386658
0 references
