Model-based clustering for covariance matrices via penalized Wishart mixture models
Andrea Cappozzo, Alessandro Casa

TL;DR
This paper introduces a sparse Wishart mixture model with a graphical lasso penalty for clustering covariance matrices, improving interpretability and scalability in high-dimensional neuroimaging data.
Contribution
It proposes a novel penalized Wishart mixture model that incorporates sparsity to handle high-dimensional covariance clustering effectively.
Findings
Successfully clusters neuroimaging data based on relational patterns.
Reduces parameter complexity through sparsity, enhancing interpretability.
Demonstrates effectiveness on simulated and real datasets.
Abstract
Covariance matrices provide a valuable source of information about complex interactions and dependencies within the data. However, from a clustering perspective, this information has often been underutilized and overlooked. Indeed, commonly adopted distance-based approaches tend to rely primarily on mean levels to characterize and differentiate between groups. Recently, there have been promising efforts to cluster covariance matrices directly, thereby distinguishing groups solely based on the relationships between variables. From a model-based perspective, a probabilistic formalization has been provided by considering a mixture model with component densities following a Wishart distribution. Notwithstanding, this approach faces challenges when dealing with a large number of variables, as the number of parameters to be estimated increases quadratically. To address this issue, we propose…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Methods and Mixture Models
