Column-coherent matrix decomposition

DOI10.1007/S10618-023-00954-4MaRDI QIDQ6535177zbMATH OpenFDO

Authors Nikolaj Tatti

Publication date 15 November 2023

Published in Data Mining and Knowledge Discovery (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10618-023-00954-4

zbMATH Keywords

approximation algorithmconsecutive ones propertydynamic programmatrix decompositionsegmentation

Mathematics Subject Classification ID

Factorization of matrices (15A23) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Optimal matrix-segmentation by rectangles
• Decomposition of integer matrices and multileaf collimator sequencing
• Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods

Cites work

• Data-streams and histograms
• Discovery Science
• On the approximation of curves by line segments using dynamic programming
• On the complexity of k-SAT
• Parameterized low-rank binary matrix approximation
• SETH-based lower bounds for subset sum and bicriteria path
• Strongly polynomial efficient approximation scheme for segmentation
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

This page was built for publication: Column-coherent matrix decomposition

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