.png){kind=icon}
返回
Greedy Segmentation for a Functional Data Sequence
.png){kind=icon}
OA
AI
DOI：10.1080/01621459.2021.1963261.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a new approach known as greedy segmentation (GS) to identify multiple changepoints for a functional data sequence. The proposed multiple changepoint detection criterion links detectability with the projection onto a suitably chosen subspace and the changepoint locations. The changepoint estimator identifies the true changepoints for any predetermined number of changepoint candidates, either over-reporting or under-reporting. This theoretical finding supports the proposed GS estimator, which can be efficiently obtained in a greedy manner. The GS estimator's consistency holds without being restricted to the conventional at most one changepoint condition, and it is robust to the relative positions of the changepoints. Based on the GS estimator, the test statistic's asymptotic distribution leads to the novel GS algorithm, which identifies the number and locations of changepoints. Using intensive simulation studies, we compare the finite sample performance of the GS approach with other competing methods. We also apply our method to temporal changepoint detection in weather datasets.
Keyword:
Covariance operator
Functional principal components
Multiple changepoints
Projection
Significance test
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
J
IF:
3
论文数:
5.2K
被引数:
4.8W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏Manipulating and Imaging the Shape of an Electronic Wave Function by Magnetotunneling Spectroscopy通过磁隧穿光谱法操纵和成像电子波函数的形状
PREAI
分享收藏
查看更多内容