An Approximation Ratio for Biclustering

12/17/2007
by   Kai Puolamäki, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/16/2020

Average Case Column Subset Selection for Entrywise ℓ_1-Norm Loss

We study the column subset selection problem with respect to the entrywi...
research
09/03/2023

On the numerical approximation of the distance to singularity for matrix-valued functions

Given a matrix-valued function ℱ(λ)=∑_i=1^d f_i(λ) A_i, with complex mat...
research
06/13/2021

Two-way Spectrum Pursuit for CUR Decomposition and Its Application in Joint Column/Row Subset Selection

The problem of simultaneous column and row subset selection is addressed...
research
10/19/2019

Convex Reconstruction of Structured Matrix Signals from Random Linear Measurements (I): Theoretical Results

We investigate the problem of reconstructing n-by-n column-wise sparse m...
research
10/16/2018

Co-manifold learning with missing data

Representation learning is typically applied to only one mode of a data ...
research
05/25/2020

On Optimal Partitioning For Sparse Matrices In Variable Block Row Format

The Variable Block Row (VBR) format is an influential blocked sparse mat...

Please sign up or login with your details

Forgot password? Click here to reset