Papers › Learning Sparsity and Block Diagonal Structure in Multi-View Mixture Models
Learning Sparsity and Block Diagonal Structure in Multi-View Mixture Models
Iain Carmichael
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Scientific studies increasingly collect multiple modalities of data to investigate a phenomenon from several perspectives. In integrative data analysis it is important to understand how information is heterogeneously spread across these different data sources. To this end, we consider a parametric clustering model for the subjects in a multi-view data set (i.e. multiple sources of data from the same set of subjects) where each view marginally follows a mixture model. In the case of two views, the dependence between them is captured by a cluster membership matrix parameter and we aim to learn the structure of this matrix (e.g. the zero pattern). First, we develop a penalized likelihood approach to estimate the sparsity pattern of the cluster membership matrix. For the specific case of block diagonal structures, we develop a constrained likelihood formulation where this matrix is constrained to be block diagonal up to permutations of the rows and columns. To enforce block diagonal constraints we propose a novel optimization approach based on the symmetric graph Laplacian. We demonstrate the performance of these methods through both simulations and applications to data sets from cancer genetics and neuroscience. Both methods naturally extend to multiple views.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections