Parameter-wise co-clustering for high-dimensional data
M.P.B. Gallaugher, C. Biernacki, and P.D. McNicholas

TL;DR
This paper introduces a flexible parameter-wise co-clustering model for high-dimensional continuous data, utilizing SEM and Gibbs sampling for estimation, and demonstrates its effectiveness through simulations and real data comparisons.
Contribution
It presents a novel, more flexible co-clustering approach for continuous data that maintains parsimony and employs SEM and Gibbs sampling for parameter estimation.
Findings
The model performs well on simulated datasets.
It outperforms traditional co-clustering methods.
Effective for high-dimensional continuous data.
Abstract
In recent years, data dimensionality has increasingly become a concern, leading to many parameter and dimension reduction techniques being proposed in the literature. A parameter-wise co-clustering model, for data modelled via continuous random variables, is presented. The proposed model, although allowing more flexibility, still maintains the very high degree of parsimony achieved by traditional co-clustering. A stochastic expectation-maximization (SEM) algorithm along with a Gibbs sampler is used for parameter estimation and an integrated complete log-likelihood criterion is used for model selection. Simulated and real datasets are used for illustration and comparison with traditional co-clustering.
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Clustering Algorithms Research · Gene expression and cancer classification · Face and Expression Recognition
