An Approximation Ratio for Biclustering

Details An Approximation Ratio for Biclustering An Approximation Ratio for Biclustering

2007-12-17

arxiv.org/abs/0712.2682v2

Information Processing Letters 108 (2008) 45-49

Computer Science

Data Structures and Algorithms

9 pages, 2 figures; presentation clarified, replaced to match the version to be published in IPL

Scientific paper

10.1016/j.ipl.2008.03.013

The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters is as uniform as possible. In this paper we approximate the optimal biclustering by applying one-way clustering algorithms independently on the rows and on the columns of the input matrix. We show that such a solution yields a worst-case approximation ratio of 1+sqrt(2) under L1-norm for 0-1 valued matrices, and of 2 under L2-norm for real valued matrices.

Affiliated with

Also associated with

No associations

Rating

An Approximation Ratio for Biclustering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Approximation Ratio for Biclustering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Approximation Ratio for Biclustering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-116084