GANIAN, Robert, Iyad KANJ, Sebastian ORDYNIAK and Stefan SZEIDER. Parameterized Algorithms for the Matrix Completion Problem. Online. In Jennifer G. Dy, Andreas Krause. Proceedings of the 35th International Conference on Machine Learning (ICML). USA: PMLR, 2018. p. 1642-1651. ISBN 978-1-5108-6796-3. [citováno 2024-04-24]
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Parameterized Algorithms for the Matrix Completion Problem
Authors GANIAN, Robert (203 Czech Republic, guarantor, belonging to the institution), Iyad KANJ (840 United States of America), Sebastian ORDYNIAK (276 Germany) and Stefan SZEIDER (40 Austria)
Edition USA, Proceedings of the 35th International Conference on Machine Learning (ICML), p. 1642-1651, 10 pp. 2018.
Publisher PMLR
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher United States of America
Confidentiality degree is not subject to a state or trade secret
Publication form electronic version available online
WWW URL
RIV identification code RIV/00216224:14330/18:00106817
Organization unit Faculty of Informatics
ISBN 978-1-5108-6796-3
UT WoS 000683379201078
Keywords in English Matrix Completion; Parameterized Complexity
Tags core_A, firank_1
Tags International impact, Reviewed
Changed by Changed by: Mgr. Michal Petr, učo 65024. Changed: 18/5/2022 10:35.
Abstract
We consider two matrix completion problems, in which we are given a matrix with missing entries and the task is to complete the matrix in a way that (1) minimizes the rank, or (2) minimizes the number of distinct rows. We study the parameterized complexity of the two aforementioned problems with respect to several parameters of interest, including the minimum number of matrix rows, columns, and rows plus columns needed to cover all missing entries. We obtain new algorithmic results showing that, for the bounded domain case, both problems are fixed-parameter tractable with respect to all aforementioned parameters. We complement these results with a lower-bound result for the unbounded domain case that rules out fixed-parameter tractability w.r.t. some of the parameters under consideration.
PrintDisplayed: 24/4/2024 08:04