Independence clustering (without a matrix)

Daniil Ryabko 1
1 SEQUEL - Sequential Learning
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Abstract : The independence clustering problem is considered in the following formulation: given a set $S$ of random variables, it is required to find the finest partitioning $\{U_1,\dots,U_k\}$ of $S$ into clusters such that the clusters $U_1,\dots,U_k$ are mutually independent. Since mutual independence is the target, pairwise similarity measurements are of no use, and thus traditional clustering algorithms are inapplicable. The distribution of the random variables in $S$ is, in general, unknown, but a sample is available. Thus, the problem is cast in terms of time series. Two forms of sampling are considered: i.i.d.\ and stationary time series, with the main emphasis being on the latter, more general, case. A consistent, computationally tractable algorithm for each of the settings is proposed, and a number of open directions for further research are outlined.
Complete list of metadatas

https://hal.inria.fr/hal-01627333
Contributor : Daniil Ryabko <>
Submitted on : Wednesday, November 1, 2017 - 9:52:10 AM
Last modification on : Friday, March 22, 2019 - 1:34:07 AM

Links full text

Identifiers

  • HAL Id : hal-01627333, version 1
  • ARXIV : 1703.06700

Citation

Daniil Ryabko. Independence clustering (without a matrix). NIPS 2017 - Thirty-first Annual Conference on Neural Information Processing Systems, Dec 2017, Long Beach, United States. pp.1-14. ⟨hal-01627333⟩

Share

Metrics

Record views

253