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

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2015

Kód důvěrnosti údajů

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

Název periodika

Journal of Computer and System Sciences

ISSN

0022-0000

e-ISSN

—

Svazek periodika

81

Číslo periodika v rámci svazku

8

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

19

Strana od-do

"1678-1697"

Kód UT WoS článku

000360777200019

EID výsledku v databázi Scopus

—