Robust Subspace Search

Aus IPD-Institutsseminar
Version vom 26. Juni 2018, 18:55 Uhr von Georg Steinbuß (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Vortrag |vortragender=Marcel Hiltscher | |vortragstyp=Proposal |betreuer=Georg Steinbuss |termin=Institutsseminar/2018-06-29…“)
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Zur Navigation springen Zur Suche springen
Vortragende(r) Marcel Hiltscher
Vortragstyp Proposal
Betreuer(in) Georg Steinbuss
Termin Fr 29. Juni 2018
Kurzfassung In this thesis, the idea of finding robust subspaces with help of an iterative process is being discussed. The process firstly aims for subspaces where hiding outliers is feasible. Subsequently, the subspaces used in the first part are being adjusted. In doing so, the convergence of this iterative process can reveal valuable insights in systems where the existence of hidden outliers poses a high risk (e.g. power station). The main part of this thesis will deal with the aspect of hiding outliers in high dimensional data spaces and the challenges resulting from such spaces.