A Comparison of Single and Multiple Changepoint Techniques for Time Series Data
时间序列单变点与多变点技术的比较AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
本页为预印本版本；arXiv 收录、作者填写的期刊信息以及作者既有发表经历，都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对，只展示已核实例，档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：摘要直接比较相关时间序列中的单变点和多变点检测、定位及分段方法。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
时间序列单变点与多变点技术的比较
- 研究问题
- 在存在序列相关且模型设定可能影响结论时，单变点与多变点检测方法如何比较，其误报率和检测能力如何变化？
- 方法与思路
- 作者比较 CUSUM、似然比及其变体，再考察多变点惩罚似然和二分分割方法，并提出衡量两种分段差异的新距离。
- 材料陈述的贡献
- 摘要称平方 CUSUM 汇总检验具有较合理的第一类错误与较高检测力；多变点比较没有明确赢家，表现依具体情境而变。
- 阅读关注点
- 应核对序列相关如何建模、边界裁剪与尺度变换的影响，以及各项性能结论的模拟场景和新分段距离的定义。
- 阅读边界
- 这是 arXiv 预印本，不能据此确认同行评审或期刊接收；摘要未提供比较数值，单变点检验的优势不能推广到全部情境。
原文摘要
This paper describes and compares several prominent single and multiple changepoint techniques for time series data. Due to their importance in inferential matters, changepoint research on correlated data has accelerated recently. Unfortunately, small perturbations in model assumptions can drastically alter changepoint conclusions; for example, heavy positive correlation in a time series can be misattributed to a mean shift should correlation be ignored. This paper considers both single and multiple changepoint techniques. The paper begins by examining cumulative sum (CUSUM) and likelihood ratio tests and their variants for the single changepoint problem; here, various statistics, boundary cropping scenarios, and scaling methods (e.g., scaling to an extreme value or Brownian Bridge limit) are compared. A recently developed test based on summing squared CUSUM statistics over all times is shown to have realistic Type I errors and superior detection power. The paper then turns to the multiple changepoint setting. Here, penalized likelihoods drive the discourse, with AIC, BIC, mBIC, and MDL penalties being considered. Binary and wild binary segmentation techniques are also compared. We introduce a new distance metric specifically designed to compare two multiple changepoint segmentations. Algorithmic and computational concerns are discussed and simulations are provided to support all conclusions. In the end, the multiple changepoint setting admits no clear methodological winner, performance depending on the particular scenario. Nonetheless, some practical guidance will emerge.