Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SWAT.2020.1
URN: urn:nbn:de:0030-drops-122487
URL: https://drops.dagstuhl.de/opus/volltexte/2020/12248/
Fomin, Fedor V. ; Golovach, Petr A. ; Simonov, Kirill
Parameterized Complexity of PCA (Invited Talk)
| pdf-format: |
|
Abstract
We discuss some recent progress in the study of Principal Component Analysis (PCA) from the perspective of Parameterized Complexity.
BibTeX - Entry
@InProceedings{fomin_et_al:LIPIcs:2020:12248,
author = {Fedor V. Fomin and Petr A. Golovach and Kirill Simonov},
title = {{Parameterized Complexity of PCA (Invited Talk)}},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)},
pages = {1:1--1:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-150-4},
ISSN = {1868-8969},
year = {2020},
volume = {162},
editor = {Susanne Albers},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12248},
URN = {urn:nbn:de:0030-drops-122487},
doi = {10.4230/LIPIcs.SWAT.2020.1},
annote = {Keywords: parameterized complexity, Robust PCA, outlier detection}
}
| Keywords: | parameterized complexity, Robust PCA, outlier detection | |
| Seminar: | 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020) | |
| Issue date: | 2020 | |
| Date of publication: | 12.06.2020 |
