An Enhanced Adaptive Bi-clustering Algorithm through Building a Shielding Complex Sub-Matrix
Kaijie Xu

TL;DR
This paper introduces an enhanced adaptive bi-clustering algorithm that constructs a shielding complex sub-matrix to effectively discover overlapping bi-clusters, improving upon the limitations of the Cheng and Church method.
Contribution
It proposes a novel shielding complex sub-matrix approach with adaptive signals and a shielding factor to improve bi-clustering, especially for overlapping clusters.
Findings
Improved bi-cluster detection on microarray data.
Effective handling of overlapping bi-clusters.
Experimental results validate the theoretical analysis.
Abstract
Bi-clustering refers to the task of finding sub-matrices (indexed by a group of columns and a group of rows) within a matrix of data such that the elements of each sub-matrix (data and features) are related in a particular way, for instance, that they are similar with respect to some metric. In this paper, after analyzing the well-known Cheng and Church (CC) bi-clustering algorithm which has been proved to be an effective tool for mining co-expressed genes. However, Cheng and Church bi-clustering algorithm and summarizing its limitations (such as interference of random numbers in the greedy strategy; ignoring overlapping bi-clusters), we propose a novel enhancement of the adaptive bi-clustering algorithm, where a shielding complex sub-matrix is constructed to shield the bi-clusters that have been obtained and to discover the overlapping bi-clusters. In the shielding complex sub-matrix,…
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
TopicsGene expression and cancer classification · Bioinformatics and Genomic Networks · Face and Expression Recognition
