Guardado en:
| Autores principales: | , , , , , , , , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2401.04693 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911752498708480 |
|---|---|
| author | Tobin, Joshua Black, Michaela Ng, James Rankin, Debbie Wallace, Jonathan Hughes, Catherine Hoey, Leane Moore, Adrian Wang, Jinling Horigan, Geraldine Carlin, Paul McNulty, Helene Molloy, Anne M Zhang, Mimi |
| author_facet | Tobin, Joshua Black, Michaela Ng, James Rankin, Debbie Wallace, Jonathan Hughes, Catherine Hoey, Leane Moore, Adrian Wang, Jinling Horigan, Geraldine Carlin, Paul McNulty, Helene Molloy, Anne M Zhang, Mimi |
| contents | The Latent Block Model (LBM) is a prominent model-based co-clustering method, returning parametric representations of each block cluster and allowing the use of well-grounded model selection methods. The LBM, while adapted in literature to handle different feature types, cannot be applied to datasets consisting of multiple disjoint sets of features, termed views, for a common set of observations. In this work, we introduce the multi-view LBM, extending the LBM method to multi-view data, where each view marginally follows an LBM. In the case of two views, the dependence between them is captured by a cluster membership matrix, and we aim to learn the structure of this matrix. We develop a likelihood-based approach in which parameter estimation uses a stochastic EM algorithm integrating a Gibbs sampler, and an ICL criterion is derived to determine the number of row and column clusters in each view. To motivate the application of multi-view methods, we extend recent work developing hypothesis tests for the null hypothesis that clusters of observations in each view are independent of each other. The testing procedure is integrated into the model estimation strategy. Furthermore, we introduce a penalty scheme to generate sparse row clusterings. We verify the performance of the developed algorithm using synthetic datasets, and provide guidance for optimal parameter selection. Finally, the multi-view co-clustering method is applied to a complex genomics dataset, and is shown to provide new insights for high-dimension multi-view problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_04693 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Co-Clustering Multi-View Data Using the Latent Block Model Tobin, Joshua Black, Michaela Ng, James Rankin, Debbie Wallace, Jonathan Hughes, Catherine Hoey, Leane Moore, Adrian Wang, Jinling Horigan, Geraldine Carlin, Paul McNulty, Helene Molloy, Anne M Zhang, Mimi Methodology The Latent Block Model (LBM) is a prominent model-based co-clustering method, returning parametric representations of each block cluster and allowing the use of well-grounded model selection methods. The LBM, while adapted in literature to handle different feature types, cannot be applied to datasets consisting of multiple disjoint sets of features, termed views, for a common set of observations. In this work, we introduce the multi-view LBM, extending the LBM method to multi-view data, where each view marginally follows an LBM. In the case of two views, the dependence between them is captured by a cluster membership matrix, and we aim to learn the structure of this matrix. We develop a likelihood-based approach in which parameter estimation uses a stochastic EM algorithm integrating a Gibbs sampler, and an ICL criterion is derived to determine the number of row and column clusters in each view. To motivate the application of multi-view methods, we extend recent work developing hypothesis tests for the null hypothesis that clusters of observations in each view are independent of each other. The testing procedure is integrated into the model estimation strategy. Furthermore, we introduce a penalty scheme to generate sparse row clusterings. We verify the performance of the developed algorithm using synthetic datasets, and provide guidance for optimal parameter selection. Finally, the multi-view co-clustering method is applied to a complex genomics dataset, and is shown to provide new insights for high-dimension multi-view problems. |
| title | Co-Clustering Multi-View Data Using the Latent Block Model |
| topic | Methodology |
| url | https://arxiv.org/abs/2401.04693 |