Skip to Main content Skip to Navigation
Conference papers

Reducing statistical time-series problems to binary classification

Daniil Ryabko 1 Jérémie Mary 1, 2
1 SEQUEL - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe, LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal
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.
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Daniil Ryabko Connect in order to contact the contributor
Submitted on : Friday, June 7, 2013 - 11:43:06 AM
Last modification on : Saturday, December 18, 2021 - 3:02:23 AM
Long-term archiving on: : Sunday, September 8, 2013 - 4:18:23 AM


Files produced by the author(s)


  • HAL Id : hal-00675637, version 5



Daniil Ryabko, Jérémie Mary. Reducing statistical time-series problems to binary classification. NIPS, Dec 2012, Lake Tahoe, United States. pp.2069--2077. ⟨hal-00675637v5⟩



Les métriques sont temporairement indisponibles