From-below approximations in Boolean matrix factorization: Geometry and new algorithm

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F15%3A33155571" target="_blank" >RIV/61989592:15310/15:33155571 - isvavai.cz</a>
Result on the web
<a href="http://www.sciencedirect.com/science/article/pii/S002200001500063X" target="_blank" >http://www.sciencedirect.com/science/article/pii/S002200001500063X</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jcss.2015.06.002" target="_blank" >10.1016/j.jcss.2015.06.002</a>

Result language
angličtina
Original language name
From-below approximations in Boolean matrix factorization: Geometry and new algorithm
Original language description
We present new results on Boolean matrix factorization and a new algorithm based on these results. The results emphasize the significance of factorizations that provide from-below approximations of the input matrix. While the previously proposed algorithms do not consider the possibly different significance of different matrix entries, our results help measure such significance and suggest where to focus when computing factors. An experimental evaluation of the new algorithm on both synthetic and real data demonstrates its good performance in terms of good coverage by the first few factors as well as a small number of factors needed for an almost exact decomposition and indicates that the algorithm outperforms the available ones in these terms. We alsopropose future research topics.
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
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
S - Specificky vyzkum na vysokych skolach

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

Similar results(10)