FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3101949476> ?p ?o ?g. }

• W3101949476 endingPage "1379" @default.
• W3101949476 startingPage "1359" @default.
• W3101949476 abstract "Principal component analysis (PCA) is one of the most widely used dimension reduction techniques. Robust PCA (RPCA) refers to the problem of PCA when the data may be corrupted by outliers. Recent work by Cands, Wright, Li, and Ma defined RPCA as a problem of decomposing a given data matrix into the sum of a low-rank matrix (true data) and a sparse matrix (outliers). The column space of the low-rank matrix then gives the PCA solution. This simple definition has led to a large amount of interesting new work on provably correct, fast, and practical solutions to RPCA. More recently, the dynamic (time-varying) version of the RPCA problem has been studied and a series of provably correct, fast, and memory-efficient tracking solutions have been proposed. Dynamic RPCA [or robust subspace tracking RST)] is the problem of tracking data lying in a (slowly) changing subspace, while being robust to sparse outliers. This paper provides an exhaustive review of the last decade of literature on RPCA and its dynamic counterpart (RST), along with describing their theoretical guarantees, discussing the pros and cons of various approaches, and providing empirical comparisons of performance and speed. A brief overview of the newer (lowrank) matrix completion (MC) literature is also provided. This refers to the problem of completing a low-rank matrix when only a subset of its entries are observed. It can be interpreted as a simpler special case of RPCA in which the indices of the outlier corrupted entries are known." @default.
• W3101949476 created "2020-11-23" @default.
• W3101949476 creator A5005043504 @default.
• W3101949476 creator A5087330283 @default.
• W3101949476 date "2018-08-01" @default.
• W3101949476 modified "2023-10-14" @default.
• W3101949476 title "Static and Dynamic Robust PCA and Matrix Completion: A Review" @default.
• W3101949476 cites W1481321471 @default.
• W3101949476 cites W1513013675 @default.
• W3101949476 cites W151981251 @default.
• W3101949476 cites W1594738692 @default.
• W3101949476 cites W1600478107 @default.
• W3101949476 cites W1605379937 @default.
• W3101949476 cites W1967336819 @default.
• W3101949476 cites W1974192600 @default.
• W3101949476 cites W1975189025 @default.
• W3101949476 cites W1987142714 @default.
• W3101949476 cites W2000157792 @default.
• W3101949476 cites W2004026774 @default.
• W3101949476 cites W2015418199 @default.
• W3101949476 cites W2044670824 @default.
• W3101949476 cites W2047071281 @default.
• W3101949476 cites W2075406189 @default.
• W3101949476 cites W2076422080 @default.
• W3101949476 cites W2078397124 @default.
• W3101949476 cites W2083987637 @default.
• W3101949476 cites W2094265461 @default.
• W3101949476 cites W2096586829 @default.
• W3101949476 cites W2098884960 @default.
• W3101949476 cites W2124449497 @default.
• W3101949476 cites W2133515443 @default.
• W3101949476 cites W2140738143 @default.
• W3101949476 cites W2145962650 @default.
• W3101949476 cites W2155813684 @default.
• W3101949476 cites W2158445689 @default.
• W3101949476 cites W2167101305 @default.
• W3101949476 cites W2168903001 @default.
• W3101949476 cites W2168955340 @default.
• W3101949476 cites W2268674159 @default.
• W3101949476 cites W2489822048 @default.
• W3101949476 cites W2503308866 @default.
• W3101949476 cites W2512442405 @default.
• W3101949476 cites W2513570774 @default.
• W3101949476 cites W2532625050 @default.
• W3101949476 cites W2566608758 @default.
• W3101949476 cites W2588853887 @default.
• W3101949476 cites W2611328865 @default.
• W3101949476 cites W2762625016 @default.
• W3101949476 cites W2790756571 @default.
• W3101949476 cites W2951401720 @default.
• W3101949476 cites W2962834831 @default.
• W3101949476 cites W2963346868 @default.
• W3101949476 cites W2963676515 @default.
• W3101949476 cites W2963935595 @default.
• W3101949476 cites W2964044134 @default.
• W3101949476 cites W3010812135 @default.
• W3101949476 cites W3104501706 @default.
• W3101949476 cites W3104624268 @default.
• W3101949476 cites W3105000828 @default.
• W3101949476 cites W3142873477 @default.
• W3101949476 cites W4250657332 @default.
• W3101949476 cites W2964167320 @default.
• W3101949476 doi "https://doi.org/10.1109/jproc.2018.2844126" @default.
• W3101949476 hasPublicationYear "2018" @default.
• W3101949476 type Work @default.
• W3101949476 sameAs 3101949476 @default.
• W3101949476 citedByCount "49" @default.
• W3101949476 countsByYear W31019494762018 @default.
• W3101949476 countsByYear W31019494762019 @default.
• W3101949476 countsByYear W31019494762020 @default.
• W3101949476 countsByYear W31019494762021 @default.
• W3101949476 countsByYear W31019494762022 @default.
• W3101949476 countsByYear W31019494762023 @default.
• W3101949476 crossrefType "journal-article" @default.
• W3101949476 hasAuthorship W3101949476A5005043504 @default.
• W3101949476 hasAuthorship W3101949476A5087330283 @default.
• W3101949476 hasBestOaLocation W31019494762 @default.
• W3101949476 hasConcept C104317684 @default.
• W3101949476 hasConcept C106487976 @default.
• W3101949476 hasConcept C11413529 @default.
• W3101949476 hasConcept C114614502 @default.
• W3101949476 hasConcept C121332964 @default.
• W3101949476 hasConcept C124101348 @default.
• W3101949476 hasConcept C153180895 @default.
• W3101949476 hasConcept C154945302 @default.
• W3101949476 hasConcept C159985019 @default.
• W3101949476 hasConcept C163716315 @default.
• W3101949476 hasConcept C164226766 @default.
• W3101949476 hasConcept C185592680 @default.
• W3101949476 hasConcept C192562407 @default.
• W3101949476 hasConcept C193252679 @default.
• W3101949476 hasConcept C202444582 @default.
• W3101949476 hasConcept C24252448 @default.
• W3101949476 hasConcept C27438332 @default.
• W3101949476 hasConcept C2777749129 @default.
• W3101949476 hasConcept C2778459887 @default.
• W3101949476 hasConcept C2780985081 @default.
• W3101949476 hasConcept C32834561 @default.

• next