The 8M Algorithm from Today's Perspective

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F21%3A73607787" target="_blank" >RIV/61989592:15310/21:73607787 - isvavai.cz</a>

Výsledek na webu

<a href="https://obd.upol.cz/id_publ/333187673" target="_blank" >https://obd.upol.cz/id_publ/333187673</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/3428078" target="_blank" >10.1145/3428078</a>

Jazyk výsledku

angličtina

Název v původním jazyce

The 8M Algorithm from Today's Perspective

Popis výsledku v původním jazyce

We provide a detailed analysis and a first complete description of 8M-an old but virtually unknown algorithm for Boolean matrix factorization. Even though the algorithm uses a rather limited insight into the factorization problem from today&apos;s perspective, we demonstrate that its performance is reasonably good compared to the currently available algorithms. Our analysis reveals that this is due to certain concepts employed by 8M that are not exploited by the current algorithms. We discuss the prospect of these concepts, utilize them to improve two well-known current factorization algorithms, and, furthermore, propose an improvement of 8M itself, which significantly enhances the performance of the original 8M. Our findings are illustrated by experimental evaluation.

Název v anglickém jazyce

The 8M Algorithm from Today's Perspective

Popis výsledku anglicky

We provide a detailed analysis and a first complete description of 8M-an old but virtually unknown algorithm for Boolean matrix factorization. Even though the algorithm uses a rather limited insight into the factorization problem from today&apos;s perspective, we demonstrate that its performance is reasonably good compared to the currently available algorithms. Our analysis reveals that this is due to certain concepts employed by 8M that are not exploited by the current algorithms. We discuss the prospect of these concepts, utilize them to improve two well-known current factorization algorithms, and, furthermore, propose an improvement of 8M itself, which significantly enhances the performance of the original 8M. Our findings are illustrated by experimental evaluation.

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

—

Návaznosti

S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2021

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

ACM Transactions on Knowledge Discovery from Data

ISSN

1556-4681

e-ISSN

—

Svazek periodika

15

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

22

Strana od-do

"22-1"-"22-22"

Kód UT WoS článku

000639049700009

EID výsledku v databázi Scopus

2-s2.0-85103942655