A new biclustering technique based on crossing minimization

Abdullah, A.; Hussain, A.

Abstract

Clustering only the records in a database (or data matrix) gives a global view of the data. For a detailed analysis or a local view, biclustering or co-clustering is required, involving the clustering of the records and the attributes simultaneously. In this paper, a new graph-drawing-based biclustering technique is proposed based on the crossing minimization paradigm that is shown to work for asymmetric overlapping biclusters in the presence of noise. Both simulated and real world data sets are used to demonstrate the superior performance of the new technique compared with two other conventional biclustering approaches.

Citation

Abdullah, A., & Hussain, A. (2006). A new biclustering technique based on crossing minimization. Neurocomputing, 69(16-18), 1882-1896. https://doi.org/10.1016/j.neucom.2006.02.018

• Journal Article Type: Article
• Acceptance Date: Feb 1, 2006
• Online Publication Date: Jul 6, 2006
• Publication Date: 2006-10
• Deposit Date: Oct 8, 2019
• Journal: Neurocomputing
• Print ISSN: 0925-2312
• Publisher: Elsevier
• Peer Reviewed: Peer Reviewed
• Volume: 69
• Issue: 16-18
• Pages: 1882-1896
• DOI: https://doi.org/10.1016/j.neucom.2006.02.018
• Keywords: Knowledge discovery; Data mining; Biclustering; Co-clustering; Graph drawing; Crossing minimization; Overlapping biclusters; Noise
• Public URL: http://researchrepository.napier.ac.uk/Output/1793595