Co-clustering under the maximum norm

DOI10.3390/A9010017MaRDI QIDQ1736769zbMATH OpenOpenAlexFDO

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

Publication date 26 March 2019

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

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)

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

Cites work

• scientific article; zbMATH DE number 6351476 (Why is no real title available?)
• scientific article; zbMATH DE number 5510691 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• A generalized maximum entropy approach to Bregman co-clustering and matrix approximation
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Approximate Boolean Reasoning: Foundations and Applications in Data Mining
• Approximation algorithms for tensor clustering
• Fundamentals of parameterized complexity
• Optimal packing and covering in the plane are NP-complete
• Parameterized algorithms

Cited in

(4)

• Co-clustering under the maximum norm
• Parameterized \(k\)-clustering: tractability island
• scientific article; zbMATH DE number 4036950 (Why is no real title available?)
• Partition of a binary matrix into \(k\) (\(k \geq 3\)) exclusive row and column submatrices is difficult

Describes a project that uses

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)