Finding biclusters by random projections

DOI10.1016/j.tcs.2006.09.023zbMath1171.68865OpenAlexW2158309583MaRDI QIDQ859851

Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Yang

Publication date: 22 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.09.023

zbMATH Keywords

bicliquesbiclusteringco-clusteringtextual matricestwo-way clustering

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Pattern recognition, speech recognition (68T10) Randomized algorithms (68W20)

Related Items (2)

Near optimal solutions for maximum quasi-bicliques ⋮ Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximum edge biclique problem is NP-complete
• Special issue: Average-case analysis of algorithms
• On Bipartite and Multipartite Clique Problems
• Approximating Clique and Biclique Problems
• Learning Theory and Kernel Machines

This page was built for publication: Finding biclusters by random projections