Independence clustering (without a matrix) - Archive ouverte HAL Access content directly
Conference Papers Year :

## Independence clustering (without a matrix)

(1)
1
Daniil Ryabko
• Function : Author
• PersonId : 848126

#### 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.

### Dates and versions

hal-01627333 , version 1 (01-11-2017)

### Identifiers

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

### Cite

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⟩

### Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

136 View