A Dynamic Programming Algorithm for the Fused Lasso and L 0-Segmentation
A Dynamic Programming Algorithm for the Fused Lasso and L 0-Segmentation
About this item
Full title
Author / Creator
Publisher
Taylor & Francis
Journal title
Language
English
Formats
Publication information
Publisher
Taylor & Francis
Subjects
More information
Scope and Contents
Contents
We propose a dynamic programming algorithm for the one-dimensional Fused Lasso Signal Approximator (FLSA). The proposed algorithm has a linear running time in the worst case. A similar approach is developed for the task of least squares segmentation, and simulations indicate substantial performance improvement over existing algorithms. Examples of...
Alternative Titles
Full title
A Dynamic Programming Algorithm for the Fused Lasso and L 0-Segmentation
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_crossref_primary_10_1080_10618600_2012_681238
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_crossref_primary_10_1080_10618600_2012_681238
Other Identifiers
ISSN
1061-8600
E-ISSN
1537-2715
DOI
10.1080/10618600.2012.681238
