Co-clustering under the maximum norm

DOI10.3390/A9010017zbMATH Open1432.68172OpenAlexW2138629073MaRDI QIDQ1736769FDOQ1736769

Authors: Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier 

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a9010017

Recommendations

• Co-clustering under the maximum norm
• scientific article; zbMATH DE number 6351476
• Partition of a binary matrix into \(k\) (\(k \geq 3\)) exclusive row and column submatrices is difficult
• NP-hardness of some max-min clustering problems
• scientific article; zbMATH DE number 2081029

zbMATH Keywords

fixed-parameter tractabilityNP-hardnessSAT-solvingmatrix partitioningbi-clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Factorization of matrices (15A23) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Title not available (Why is that?)
• A generalized maximum entropy approach to Bregman co-clustering and matrix approximation
• Fundamentals of parameterized complexity
• Title not available (Why is that?)
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Parameterized Algorithms
• Title not available (Why is that?)
• Optimal packing and covering in the plane are NP-complete
• Approximation algorithms for tensor clustering
• Approximate Boolean Reasoning: Foundations and Applications in Data Mining
• Title not available (Why is that?)

Cited In (2)

• Parameterized \(k\)-clustering: tractability island
• Title not available (Why is that?)

Uses Software

• PicoSAT

This page was built for publication: Co-clustering under the maximum norm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736769)