This paper studies online change detection in exponential families when both the parameters before and after change are unknown. We follow a standard statistical approach to sequential change detection with generalized likelihood ratio test statistics. We interpret these statistics within the framework of information geometry, hence providing a unified view of change detection for many common statistical models and corresponding distance functions. Using results from convex duality, we also derive an efficient scheme to compute the exact statistics sequentially, which allows their use in online settings where they are usually approximated for the sake of tractability. This is applied to real-world datasets of various natures, including onset detection in audio signals. © 2013 Springer-Verlag.
CITATION STYLE
Dessein, A., & Cont, A. (2013). Online change detection in exponential families with unknown parameters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8085 LNCS, pp. 633–640). https://doi.org/10.1007/978-3-642-40020-9_70
Mendeley helps you to discover research relevant for your work.