Parameterized Algorithms for the Matrix Completion Problem

D 2018

Parameterized Algorithms for the Matrix Completion Problem

GANIAN, Robert, Iyad KANJ, Sebastian ORDYNIAK a Stefan SZEIDER

Základní údaje

Originální název

Parameterized Algorithms for the Matrix Completion Problem

Autoři

GANIAN, Robert (203 Česká republika, garant, domácí), Iyad KANJ (840 Spojené státy), Sebastian ORDYNIAK (276 Německo) a Stefan SZEIDER (40 Rakousko)

Vydání

USA, Proceedings of the 35th International Conference on Machine Learning (ICML), od s. 1642-1651, 10 s. 2018

Nakladatel

PMLR

Další údaje

Jazyk

angličtina

Typ výsledku

Stať ve sborníku

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Spojené státy

Utajení

není předmětem státního či obchodního tajemství

Forma vydání

elektronická verze "online"

Odkazy

URL

Kód RIV

RIV/00216224:14330/18:00106817

Organizační jednotka

Fakulta informatiky

ISBN

978-1-5108-6796-3

UT WoS

000683379201078

Klíčová slova anglicky

Matrix Completion; Parameterized Complexity

Štítky

core_A, firank_1

Příznaky

Mezinárodní význam, Recenzováno

Změněno: 18. 5. 2022 10:35, Mgr. Michal Petr

Anotace

V originále

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.

Citovat

GANIAN, Robert, Iyad KANJ, Sebastian ORDYNIAK a 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, s. 1642-1651. ISBN 978-1-5108-6796-3.

@inproceedings{1523818,
   author = {Ganian, Robert and Kanj, Iyad and Ordyniak, Sebastian and Szeider, Stefan},
   address = {USA},
   booktitle = {Proceedings of the 35th International Conference on Machine Learning (ICML)},
   editor = {Jennifer G. Dy, Andreas Krause},
   keywords = {Matrix Completion; Parameterized Complexity},
   howpublished = {elektronická verze "online"},
   language = {eng},
   location = {USA},
   isbn = {978-1-5108-6796-3},
   pages = {1642-1651},
   publisher = {PMLR},
   title = {Parameterized Algorithms for the Matrix Completion Problem},
   url = {http://proceedings.mlr.press/v80/ganian18a.html},
   year = {2018}
}

TY  - JOUR
ID  - 1523818
AU  - Ganian, Robert - Kanj, Iyad - Ordyniak, Sebastian - Szeider, Stefan
PY  - 2018
TI  - Parameterized Algorithms for the Matrix Completion Problem
PB  - PMLR
CY  - USA
SN  - 9781510867963
KW  - Matrix Completion
KW  - Parameterized Complexity
UR  - http://proceedings.mlr.press/v80/ganian18a.html
L2  - http://proceedings.mlr.press/v80/ganian18a.html
N2  - 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.
ER  -

GANIAN, Robert, Iyad KANJ, Sebastian ORDYNIAK a Stefan SZEIDER. Parameterized Algorithms for the Matrix Completion Problem. Online. In Jennifer G. Dy, Andreas Krause. \textit{Proceedings of the 35th International Conference on Machine Learning (ICML)}. USA: PMLR, 2018, s.~1642-1651. ISBN~978-1-5108-6796-3.

Podrobný výpis o publikaci