Reducing Statistical Time-Series Problems to Binary Classification
Abstract
We show how binary classification methods developed to work on i.i.d. data can be used for solving statistical problems that are seemingly unrelated to classification and concern highly-dependent time series. Specifically, the problems of time-series clustering, homogeneity testing and the three-sample problem are addressed. The algorithms that we construct for solving these problems are based on a new metric between time-series distributions, which can be evaluated using binary classification methods. Universal consistency of the proposed algorithms is proven under most general assumptions. The theoretical results are illustrated with experiments on synthetic and real-world data.
Cite
Text
Ryabko and Mary. "Reducing Statistical Time-Series Problems to Binary Classification." Neural Information Processing Systems, 2012.Markdown
[Ryabko and Mary. "Reducing Statistical Time-Series Problems to Binary Classification." Neural Information Processing Systems, 2012.](https://mlanthology.org/neurips/2012/ryabko2012neurips-reducing/)BibTeX
@inproceedings{ryabko2012neurips-reducing,
title = {{Reducing Statistical Time-Series Problems to Binary Classification}},
author = {Ryabko, Daniil and Mary, Jeremie},
booktitle = {Neural Information Processing Systems},
year = {2012},
pages = {2060-2068},
url = {https://mlanthology.org/neurips/2012/ryabko2012neurips-reducing/}
}