A new algorithm for Boolean matrix factorization which admits overcovering

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F18%3A73588502" target="_blank" >RIV/61989592:15310/18:73588502 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.sciencedirect.com/science/article/pii/S0166218X18303755" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0166218X18303755</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.dam.2017.12.044" target="_blank" >10.1016/j.dam.2017.12.044</a>

Jazyk výsledku

angličtina

Název v původním jazyce

A new algorithm for Boolean matrix factorization which admits overcovering

Popis výsledku v původním jazyce

We present a new algorithm for general Boolean matrix factorization. The algorithm is based on two key ideas. First, it utilizes formal concepts of the factorized matrix as crucial components of constructed factors. Second, it performs steps back during the construction of factors to see if some of the already constructed factors may be improved or even eliminated in view of the subsequently added factors. The second idea is inspired by 8M—an old, previously incompletely described and virtually unknown factorization algorithm, which we analyze and describe in detail. We provide experimental evaluation of the new algorithm and compare it to 8M and two other well-known algorithms. The results demonstrate that our algorithm outperforms these algorithms in terms of quality of the decompositions as well in its robustness with respect to small changes in data.

Název v anglickém jazyce

A new algorithm for Boolean matrix factorization which admits overcovering

Popis výsledku anglicky

We present a new algorithm for general Boolean matrix factorization. The algorithm is based on two key ideas. First, it utilizes formal concepts of the factorized matrix as crucial components of constructed factors. Second, it performs steps back during the construction of factors to see if some of the already constructed factors may be improved or even eliminated in view of the subsequently added factors. The second idea is inspired by 8M—an old, previously incompletely described and virtually unknown factorization algorithm, which we analyze and describe in detail. We provide experimental evaluation of the new algorithm and compare it to 8M and two other well-known algorithms. The results demonstrate that our algorithm outperforms these algorithms in terms of quality of the decompositions as well in its robustness with respect to small changes in data.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

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

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2018

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

DISCRETE APPLIED MATHEMATICS

ISSN

0166-218X

e-ISSN

—

Svazek periodika

249

Číslo periodika v rámci svazku

NOV

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

17

Strana od-do

36-52

Kód UT WoS článku

000449567300005

EID výsledku v databázi Scopus

2-s2.0-85051528536