Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
 
 
DownloadE-Mail
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Boolean Matrix Factorization with Missing Values

Yadava, P. (2012). Boolean Matrix Factorization with Missing Values. Master Thesis, Universität des Saarlandes, Saarbrücken.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-627A-3 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-0019-BC10-3
Genre: Hochschulschrift

Dateien

einblenden: Dateien
ausblenden: Dateien
:
Master_Thesis_Yadava.pdf (beliebiger Volltext), 919KB
 
Datei-Permalink:
-
Name:
Master_Thesis_Yadava.pdf
Beschreibung:
-
OA-Status:
Sichtbarkeit:
Privat
MIME-Typ / Prüfsumme:
application/pdf
Technische Metadaten:
Copyright Datum:
-
Copyright Info:
-
Lizenz:
-

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Yadava, Prashant1, Autor           
Weikum, Gerhard1, Ratgeber           
Miettinen, Pauli1, Ratgeber           
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: Is it possible to meaningfully analyze the structure of a Boolean matrix for which 99% data is missing? Real-life data sets usually contain a high percentage of missing values which hamper structure estimation from the data and the difficulty only increases when the missing values dominate the known elements in the data set. There are good real-valued factorization methods for such scenarios, but there exist another class of data "Boolean data", which demand a different handling strategy than their real-valued counterpart. There are many application which find logical representation only via Boolean matrices, where real-valued factorization methods do not provide correct and intuitive solutions. Currently, there exists no method which can factorize a Boolean matrix containing a percentage of missing values usually associated with non-trivial real-world data set. In this thesis, we introduce a method to fill this gap. Our method is based on the correlation among the data records and is not restricted by the percentage of unknowns in the matrix. It performs greedy selection of the basis vectors, which represent the underlying structure in the data. This thesis also presents several experiments on a variety of synthetic and real-world data, and discusses the performance of the algorithm for a range of data properties. However, it was not easy to obtain comparison statistics with existing methods, for the reason that none exist. Hence we present indirect comparisons with existing matrix completion methods which work with real-valued data sets.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2012-11-222012
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: Saarbrücken : Universität des Saarlandes
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 647476
Anderer: Local-ID: C1256DBF005F876D-394341F10E7CB40AC1257AAD00334BB1-Yadava2012
BibTex Citekey: Yadava2012
 Art des Abschluß: Master

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle

einblenden: