Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
 
 
DownloadE-Mail
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Boolean Tensor Factorization

Miettinen, P. (2011). Boolean Tensor Factorization. In D. Cook, J. Pei, W. Wang, O. Zaïane, & X. Wu (Eds.), 11th IEEE International Conference on Data Mining (pp. 447-456). Los Alamitos, CA: IEEE. doi:10.1109/ICDM.2011.28.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-0010-1427-1 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-1339-3
Genre: Konferenzbeitrag

Externe Referenzen

einblenden:

Urheber

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

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: Tensors are multi-way generalizations of matrices, and similarly to matrices, they can also be factorized, that is, represented (approximately) as a product of factors. These factors are typically either all matrices or a mixture of matrices and tensors. With the widespread adoption of matrix factorization techniques in data mining, also tensor factorizations have started to gain attention. In this paper we study the Boolean tensor factorizations. We assume that the data is binary multi-way data, and we want to factorize it to binary factors using Boolean arithmetic (i.e.\ defining that $1+1=1$). Boolean tensor factorizations are, therefore, natural generalization of the Boolean matrix factorizations. We will study the theory of Boolean tensor factorizations and show that at least some of the benefits Boolean matrix factorizations have over normal matrix factorizations carry over to the tensor data. We will also present algorithms for Boolean variations of CP and Tucker decompositions, the two most-common types of tensor factorizations. With experimentation done with synthetic and real-world data, we show that Boolean tensor factorizations are a viable alternative when the data is naturally binary.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 20112011
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 618994
DOI: 10.1109/ICDM.2011.28
URI: http://dx.doi.org/10.1109/ICDM.2011.28
Anderer: Local-ID: C1256DBF005F876D-1DF50AA1E5A9C2C7C125796C00480B2D-miettinen11boolean
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: 11th IEEE International Conference on Data Mining
Veranstaltungsort: Vancouver, Canada
Start-/Enddatum: 2011-12-20 - 2011-12-20

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: 11th IEEE International Conference on Data Mining
  Kurztitel : ICDM 2011
Genre der Quelle: Konferenzband
 Urheber:
Cook, Diane1, Herausgeber
Pei, Jian1, Herausgeber
Wang, Wei1, Herausgeber
Zaïane, Osmar1, Herausgeber
Wu, Xindong1, Herausgeber
Affiliations:
1 External Organizations, ou_persistent22            
Ort, Verlag, Ausgabe: Los Alamitos, CA : IEEE
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 447 - 456 Identifikator: ISBN: 978-0-7695-4408-3