DUST: A Duality-Based Pruning Method For Exact Multiple Change-Point Detection
DUST:基于对偶性的精确多变点检测剪枝方法
We tackle the challenge of detecting multiple change points in large time series by optimising a penalised likelihood derived from exponential family models. Dynamic programming algorithms can solve this task exactly with at most quadratic time complexity. In recent years, the development of pruning strategies has drastically improved their computational efficiency. However, the two existing approaches have notable limitations: PELT struggles with pruning efficiency in…