Factorizing three-way binary data

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F10%3A10216447" target="_blank" >RIV/61989592:15310/10:10216447 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Factorizing three-way binary data
Original language description
We present a problem of factor analysis of three-way binary data, i.e. data described by a 3-dimensional binary matrix I, describing a relationship between objects, attributes, and conditions. The problem consists in finding a small number of factors which explain the data. In terms of matrix decompositon, we look for a decomposition of I into three binary matrices, an object-factor matrix A, an attribute-factor matrix B, and a condition-factor matrix C, with the number of factors as small as possible.Compared to other decomposition-based methods, the diff erence consists in the composition operator and the constraint on A, B, and C to be binary. Due to the space limit, we present the problem statement, a non-technical description of our approach, and, as the main part, an illustrative example.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/GAP202%2F10%2F0262" target="_blank" >GAP202/10/0262: Decompositions of matrices with binary and ordinal data: theory, algorithms, and complexity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)