.png){kind=icon}
Return
l1 Trend Filtering
.png){kind=icon}
PRE
AI
DOI：10.1137/070690274.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The problem of estimating underlying trends in time series data arises in a variety of disciplines. In this paper we propose a variation on Hodrick-Prescott (H-P) filtering, a widely used method for trend estimation. The proposed l(1) trend filtering method substitutes a sum of absolute values (i.e., l(1) norm) for the sum of squares used in H-P filtering to penalize variations in the estimated trend. The l(1) trend filtering method produces trend estimates that are piecewise linear, and therefore it is well suited to analyzing time series with an underlying piecewise linear trend. The kinks, knots, or changes in slope of the estimated trend can be interpreted as abrupt changes or events in the underlying dynamics of the time series. Using specialized interior-point methods, l(1) trend filtering can be carried out with not much more effort than H-P filtering; in particular, the number of arithmetic operations required grows linearly with the number of data points. We describe the method and some of its basic properties and give some illustrative examples. We show how the method is related to l(1) regularization-based methods in sparse signal recovery and feature selection, and we list some extensions of the basic method.
Keywords:
detrending
l(1) regularization
Hodrick-Prescott filtering
piecewise linear fitting
sparse signal recovery
feature selection
time series analysis
trend estimation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.1
Papers:
888
Citations:
1.2W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSave
View more