An approximation ratio for biclustering (Q975394): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Consensus algorithms for the generation of all maximal bicliques / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2934696 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Local Search Heuristics for <i>k</i>-Median and Facility Location Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Clustering large graphs via the singular value decomposition / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Arboricity and bipartite subgraph listing algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximating Clique and Biclique Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3994557 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A local search approximation algorithm for \(k\)-means clustering / rank | |||
Normal rank |
Revision as of 21:24, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An approximation ratio for biclustering |
scientific article |
Statements
An approximation ratio for biclustering (English)
0 references
9 June 2010
0 references
approximation algorithms
0 references
biclustering
0 references
one-way clustering
0 references