MLLGGNAug 28, 2023

Biclustering Methods via Sparse Penalty

arXiv:2308.14388v2h-index: 2
Originality Synthesis-oriented
AI Analysis

This is an incremental improvement for gene expression analysis in bioinformatics.

The paper applied a Prenet penalty from factor analysis to biclustering via sparse SVD, finding it effective for non-overlapped data in simulations with different sparsity and dimensions, and demonstrated it on real gene expression data.

In this paper, we first reviewed several biclustering methods that are used to identify the most significant clusters in gene expression data. Here we mainly focused on the SSVD(sparse SVD) method and tried a new sparse penalty named "Prenet penalty" which has been used only in factor analysis to gain sparsity. Then in the simulation study, we tried different types of generated datasets (with different sparsity and dimension) and tried 1-layer approximation then for k-layers which shows the mixed Prenet penalty is very effective for non-overlapped data. Finally, we used some real gene expression data to show the behavior of our methods.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes