From-below Boolean matrix factorization algorithm based on MDL

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F21%3A73607829" target="_blank" >RIV/61989592:15310/21:73607829 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/article/10.1007/s11634-019-00383-6" target="_blank" >https://link.springer.com/article/10.1007/s11634-019-00383-6</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s11634-019-00383-6" target="_blank" >10.1007/s11634-019-00383-6</a>

Result language
angličtina
Original language name
From-below Boolean matrix factorization algorithm based on MDL
Original language description
During the past few years Boolean matrix factorization (BMF) has become an important direction in data analysis. The minimum description length principle (MDL) was successfully adapted in BMF for the model order selection. Nevertheless, a BMF algorithm performing good results w.r.t. standard measures in BMF is missing. In this paper, we propose a novel from-below Boolean matrix factorization algorithm based on formal concept analysis. The algorithm utilizes the MDL principle as a criterion for the factor selection. On various experiments we show that the proposed algorithm outperforms—from different standpoints—existing state-of-the-art BMF algorithms.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Similar results(10)