Timezone: »
Poster
Independence clustering (without a matrix)
Daniil Ryabko
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 fascinating open directions for further research are outlined.
Author Information
Daniil Ryabko (INRIA)
More from the Same Authors
-
2012 Poster: Online Regret Bounds for Undiscounted Continuous Reinforcement Learning »
Ronald Ortner · Daniil Ryabko -
2012 Poster: Reducing statistical time-series problems to binary classification »
Daniil Ryabko · Jeremie Mary -
2012 Poster: Locating Changes in Highly Dependent Data with Unknown Number of Change Points »
Azadeh Khaleghi · Daniil Ryabko -
2012 Spotlight: Locating Changes in Highly Dependent Data with Unknown Number of Change Points »
Azadeh Khaleghi · Daniil Ryabko -
2011 Poster: Selecting the State-Representation in Reinforcement Learning »
Odalric-Ambrym Maillard · Remi Munos · Daniil Ryabko