A pruned dynamic programming algorithm to recover the best segmentations with $1$ to $K_{max}$ change-points (Q106351): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q2803793
 
description / endescription / en
 
scientific article; zbMATH DE number 6576366
Property / publication date
 
2 May 2016
Timestamp+2016-05-02T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 2 May 2016 / rank
 
Normal rank
Property / author
 
Property / author: Guillem Rigaill / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1381.90094 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://arxiv.org/abs/1004.0887 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: http://journal-sfds.fr/article/view/485/ / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C39 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 62M99 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 62F10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 62J05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6576366 / rank
 
Normal rank
Property / zbMATH Keywords
 
multiple-change-point detection
Property / zbMATH Keywords: multiple-change-point detection / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic programming
Property / zbMATH Keywords: dynamic programming / rank
 
Normal rank
Property / zbMATH Keywords
 
functional cost
Property / zbMATH Keywords: functional cost / rank
 
Normal rank
Property / zbMATH Keywords
 
segment neighbourhood
Property / zbMATH Keywords: segment neighbourhood / rank
 
Normal rank

Latest revision as of 10:41, 26 April 2024

scientific article; zbMATH DE number 6576366
Language Label Description Also known as
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
    0 references
    stat.CO
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    multiple-change-point detection
    0 references
    dynamic programming
    0 references
    functional cost
    0 references
    segment neighbourhood
    0 references