An approximation ratio for biclustering

DOI10.1016/j.ipl.2008.03.013zbMath1191.68873arXiv0712.2682OpenAlexW2152668278MaRDI QIDQ975394

Kai Puolamäkia, Gemma C. Garriga, Sami Hanhijärvi

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0712.2682

zbMATH Keywords

approximation algorithmsbiclusteringone-way clustering

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items (2)

Comparing apples and oranges: measuring differences between exploratory data mining results ⋮ Approximation Algorithms for Tensor Clustering

Uses Software

• k-means++

Cites Work

• Unnamed Item
• Unnamed Item
• A local search approximation algorithm for \(k\)-means clustering
• Clustering large graphs via the singular value decomposition
• Consensus algorithms for the generation of all maximal bicliques
• Arboricity and bipartite subgraph listing algorithms
• Approximating Clique and Biclique Problems
• Local Search Heuristics for k-Median and Facility Location Problems

This page was built for publication: An approximation ratio for biclustering