Computational Complexity Of Bi-clustering
In this work we formalize a new natural objective (or cost) function for bi-clustering - Monochromatic bi-clustering. Our objective function is suitable for detecting meaningful homogenous clusters based on categorical valued input matrices. Such problems have arisen recently in systems biology wher...
Main Author: | Wulff, Sharon Jay |
---|---|
Language: | en |
Published: |
2008
|
Subjects: | |
Online Access: | http://hdl.handle.net/10012/3900 |
Similar Items
-
Computational Complexity Of Bi-clustering
by: Wulff, Sharon Jay
Published: (2008) -
Approximation of Euclidean k-size cycle cover problem
by: Michael Khachay, et al.
Published: (2014-12-01) -
Parameterized complexity and polynomial-time approximation schemes
by: Huang, Xiuzhen
Published: (2005) -
Co-Clustering under the Maximum Norm
by: Laurent Bulteau, et al.
Published: (2016-02-01) -
Approximation Algorithms for Rectangle Piercing Problems
by: Mahmood, Abdullah-Al
Published: (2006)