On optimal multiple changepoint algorithms for large data (Q106347)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6697671
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On optimal multiple changepoint algorithms for large data |
scientific article; zbMATH DE number 6697671 |
Statements
27
0 references
2
0 references
519-533
0 references
15 February 2016
0 references
28 March 2017
0 references
On optimal multiple changepoint algorithms for large data (English)
0 references
breakpoints
0 references
dynamic programming
0 references
FPOP
0 references
SNIP
0 references
optimal partitioning
0 references
pDPA
0 references
PELT
0 references
segment neighbourhood
0 references
0 references
0 references
0 references
0.8618385791778564
0 references
0.848587155342102
0 references
0.8336299657821655
0 references
0.7889044880867004
0 references
0.7846242785453796
0 references
Robert Maidstone
0 references
Toby Hocking
0 references
Paul Fearnhead
0 references
