通过最小有效划分实现精确的多重转折点检测
Exact Multiple Change-Point Detection Via Smallest Valid Partitioning
AI总结：
本文提出了一种基于最小有效划分的精确多重转折点检测方法，通过局部有效性测试和字典序优化实现简洁且高效的分段解决方案。
摘要：
我们介绍了最小有效划分（SVP），一种用于时间序列中多重转折点检测的分段方法。SVP依赖于局部的段有效性概念：候选段只有通过用户选择的有效性测试（例如单个转折点测试）才会被保留。从有效的段集合中，我们提出了一种连贯的聚合程序，该程序构建了一个全局分段，它是优化问题的精确解。我们的主要贡献是使用字典序对优化问题进行排序，以优先考虑简洁性。我们分析了所得到过程的计算复杂性，其范围从线性到三次时间，取决于所选成本和有效性函数、数据制度以及检测到的转折点数量。最后，我们通过与标准最优分段算法的比较评估了SVP的质量，证明SVP在产生具有竞争力的分段的同时，明确地强制执行段有效性。SVP的灵活性使其适用于广泛的问题类别；作为示例，我们通过在有效性标准中编码鲁棒性来展示鲁棒的转折点检测。
英文摘要：
We introduce smallest valid partitioning (SVP), a segmentation method for multiple change-point detection in time-series. SVP relies on a local notion of segment validity: a candidate segment is retained only if it passes a user-chosen validity test (e.g., a single change-point test). From the collection of valid segments, we propose a coherent aggregation procedure that constructs a global segmentation which is the exact solution of an optimization problem. Our main contribution is the use of a lexicographic order for the optimization problem that prioritizes parsimony. We analyze the computational complexity of the resulting procedure, which ranges from linear to cubic time depending on the chosen cost and validity functions, the data regime and the number of detected changes. Finally, we assess the quality of SVP through comparisons with standard optimal partitioning algorithms, showing that SVP yields competitive segmentations while explicitly enforcing segment validity. The flexibility of SVP makes it applicable to a broad class of problems; as an illustration, we demonstrate robust change-point detection by encoding robustness in the validity criterion.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
