Online bi-clustering with sparsity priors - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2014

Online bi-clustering with sparsity priors

Sébastien Loustau
  • Fonction : Auteur
  • PersonId : 992629

Résumé

Given a deterministic matrix M = (m ij), we want to cluster the row i and the column j before to predict m ij , where the values of the matrix are observed sequentially. The proposed algorithms are PAC-Bayesian procedures with new sparsity priors. Sparsity regret bounds are stated without any assumption on the matrix. These results are based on [13] where online clustering algorithms are suggested. Eventually, we also state minimax lower bounds for these problems, using a classical probabilistic reduction scheme. It shows the minimax optimality of the proposed algorithms in a worst case scenario.
Fichier principal
Vignette du fichier
online2.pdf (371.3 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01080554 , version 1 (05-11-2014)

Identifiants

  • HAL Id : hal-01080554 , version 1

Citer

Sébastien Loustau. Online bi-clustering with sparsity priors. 2014. ⟨hal-01080554⟩

Collections

UNIV-ANGERS
11 Consultations
2 Téléchargements

Partager

Gmail Facebook X LinkedIn More