Discovery of factors in binary data via triangular decomposition of matrices
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F08%3A00005459" target="_blank" >RIV/61989592:15310/08:00005459 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Discovery of factors in binary data via triangular decomposition of matrices
Original language description
We present new methods of decomposition of an $n times m$ binary matrix $I$ into a product $Aast B$ of an $n times k$ binary matrix $A$ and a $k times m$ binary matrix $B$. These decompositions are alternative to the usual one which is sought in Boolean factor analysis (BFA), where $ast$ is a Boolean product of matrices. In the new decompositions, $ast$ are the left and the right triangular products of Boolean matrices. In BFA, $I$ is interpreted as object $times$ attribute matrix, $A$ and $B$ are interpreted as object $times$ factor and factor $times$ attribute matrices, and the aim is to find a decomposition with the number $k$ of factors as small as possible. The new decompositions have different semantics from the one with Boolean matrix product. The presented methods are optimal in that they provide the smallest number $k$ possible. We provide a geometric insight showing that the factors correspond to I-beam- and H-beam-shaped patterns in the input matrix. We present an a
Czech name
Objevování faktoru v binárních datech pomocí triangulární dekompozice matic
Czech description
Objevování faktoru v binárních datech pomocí triangulární dekompozice matic.
Classification
Type
D - Article in proceedings
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1ET101370417" target="_blank" >1ET101370417: Hierarchical analysis of complex data</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2008
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Information Processing and Management of Uncertainty in Knowledge-Based Systems
ISBN
978-84-612-3061-7
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
—
Publisher name
University of Malaga
Place of publication
Malaga, Španělsko
Event location
—
Event date
—
Type of event by nationality
—
UT code for WoS article
—