Browsing Mathematics (Faculty of) by Subject "NP-hardness"
Now showing items 1-1 of 1
-
Computational Complexity Of Bi-clustering
(University of Waterloo, 2008-08-26)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 ...