The development of an information criterion for Change-Point Analysis

May 21, 2015 Β· Declared Dead Β· πŸ› Neural Computation

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Paul A. Wiggins, Colin H. LaMont arXiv ID 1505.05572 Category physics.data-an Cross-listed cs.LG, stat.ML Citations 17 Venue Neural Computation Last Checked 3 months ago
Abstract
Change-point analysis is a flexible and computationally tractable tool for the analysis of times series data from systems that transition between discrete states and whose observables are corrupted by noise. The change-point algorithm is used to identify the time indices (change points) at which the system transitions between these discrete states. We present a unified information-based approach to testing for the existence of change points. This new approach reconciles two previously disparate approaches to Change-Point Analysis (frequentist and information-based) for testing transitions between states. The resulting method is statistically principled, parameter and prior free and widely applicable to a wide range of change-point problems.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” physics.data-an

Died the same way β€” πŸ‘» Ghosted