JournalVolume 9, Special Issue on BioinformaticsRobust clustering by double bisection crossing minimization (pages 4-18) Ahsan Abdullah Abstract. In this paper, a novel and fast noise tolerant, graph drawing based, clustering and visualization algorithm is proposed for one-way clustering of gene expression data. The proposed novel divide-and-conquer algorithm works by repeatedly bisecting the similarity matrix along x-axis and y-axis, and ignoring the noise space while running Crossing Minimization Heuristics on the remaining parts of the matrix i.e. data space and thus achieves provably good clustering under very noisy conditions. The proposed Robust Clustering or RC algorithm does not require thresholds, or a-priori knowledge to achieve cluster extraction. Comparing the proposed RC algorithm with contemporary techniques using simulated data under different noise conditions shows its high immunity to noise, and comparison using real gene expression data shows promising results.
|
|