The Community for Technology Leaders
2013 IEEE 13th International Conference on Data Mining (2012)
Brussels, Belgium Belgium
Dec. 10, 2012 to Dec. 13, 2012
ISSN: 1550-4786
ISBN: 978-1-4673-4649-8
pp: 1056-1061
ABSTRACT
The availability of large microarray data has led to a growing interest in biclustering methods in the past decade. Several algorithms have been proposed to identify subsets of genes and conditions according to different similarity measures and under varying constraints. In this paper we focus on the exclusive row biclusteing problem (also known as projected clustering) for gene expression data sets, in which each row can only be a member of a single bicluster while columns can participate in multiple clusters. This type of biclustering may be adequate, for example, for clustering groups of cancer patients where each patient (row) is expected to be carrying only a single type of cancer, while each cancer type is associated with multiple (and possibly overlapping) genes (columns). In this paper we present a novel method to identify these exclusive row biclusters through a combination of existing biclustering algorithms and combinatorial auction techniques. We devise an approach for tuning the threshold for our algorithm based on comparison to a null model in the spirit of the Gap statistic approach. We demonstrate our approach on both synthetic and real-world gene expression data and show its power in identifying large span non-overlapping rows sub matrices, while considering their unique nature. The Gap statistic approach succeeds in identifying appropriate thresholds in all our examples.
INDEX TERMS
Exclusive Row Biclustering, Gene Expression, Biclustering, Projected Clustering
CITATION
Amichai Painsky, Saharon Rosset, "Exclusive Row Biclustering for Gene Expression Using a Combinatorial Auction Approach", 2013 IEEE 13th International Conference on Data Mining, vol. 00, no. , pp. 1056-1061, 2012, doi:10.1109/ICDM.2012.25
90 ms
(Ver 3.3 (11022016))