Random Matrix Improved Subspace Clustering
Résumé
This article introduces a spectral method for statistical subspace clustering. The method is built upon standard kernel spectral clustering techniques, however carefully tuned by theoretical understanding arising from random matrix findings. We show in particular that our method provides high clustering performance while standard kernel choices provably fail. An application to user grouping based on vector channel observations in the context of massive MIMO wireless communication networks is provided.
Domaines
Probabilités [math.PR]Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...