Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
  Robust Principal Component Analysis as a Nonlinear Eigenproblem

Podosinnikova, A. (2013). Robust Principal Component Analysis as a Nonlinear Eigenproblem. Master Thesis, Universität des Saarlandes, Saarbrücken.

Item is

Dateien

einblenden: Dateien
ausblenden: Dateien
:
2013_Podosinnikova_MSc Thesis.pdf (beliebiger Volltext), 953KB
 
Datei-Permalink:
-
Name:
2013_Podosinnikova_MSc Thesis.pdf
Beschreibung:
-
OA-Status:
Sichtbarkeit:
Eingeschränkt (Max Planck Institute for Informatics, MSIN; )
MIME-Typ / Prüfsumme:
application/pdf
Technische Metadaten:
Copyright Datum:
-
Copyright Info:
-
Lizenz:
-

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Podosinnikova, Anastasia1, Autor           
Hein, Matthias2, Ratgeber
Gemulla, Rainer3, Gutachter           
Affiliations:
1International Max Planck Research School, MPI for Informatics, Max Planck Society, ou_1116551              
2External Organizations, ou_persistent22              
3Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: Principal Component Analysis (PCA) is a widely used tool for, e.g., exploratory data analysis, dimensionality reduction and clustering. However, it is well known that PCA is strongly aected by the presence of outliers and, thus, is vulnerable to both gross measurement error and adversarial manipulation of the data. This phenomenon motivates the development of robust PCA as the problem of recovering the principal components of the uncontaminated data. In this thesis, we propose two new algorithms, QRPCA and MDRPCA, for robust PCA components based on the projection-pursuit approach of Huber. While the resulting optimization problems are non-convex and non-smooth, we show that they can be eciently minimized via the RatioDCA using bundle methods/accelerated proximal methods for the interior problem. The key ingredient for the most promising algorithm (QRPCA) is a robust, location invariant scale measure with breakdown point 0.5. Extensive experiments show that our QRPCA is competitive with current state-of-the-art methods and outperforms other methods in particular for a large number of outliers.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2013-072013
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: Saarbrücken : Universität des Saarlandes
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: BibTex Citekey: Podosinnikova2013
 Art des Abschluß: Master

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle

einblenden: