Robust clustering by double bisection crossing minimization

MaRDI QIDQ3562847zbMATH OpenFDO

Authors Ahsan Abdullah

Publication date 28 May 2010

Full work available at URL http://www.science.az/acm/V2010_1.9_/4-18.pdf

zbMATH Keywords

crossing minimizationdata miningdivide and conquermicroarraynoise removal

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to biology and medical sciences; meta analysis (62P10) Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40)

Recommendations

• Robust double clustering: a method based on alternating concentration steps
• scientific article; zbMATH DE number 6433485
• A robust algorithm for automatic extraction of an unknown number of clusters from noisy data
• A probabilistic relaxation labeling framework for reducing the noise effect in geometric biclustering of gene expression data
• A robust clustering method and visualization tool based on data depth

Cited in

(8)

• Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization
• Robust \(k\)-means clustering for distributions with two moments
• Robust clustering tools based on optimal transportation
• A proposal for robust curve clustering
• Box-bisection for solving second-degree systems and the problem of clustering
• scientific article; zbMATH DE number 1945188 (Why is no real title available?)
• ROBP a robust border-peeling clustering using Cauchy kernel
• Robust double clustering: a method based on alternating concentration steps

This page was built for publication: Robust clustering by double bisection crossing minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3562847)