Factorization of matrices with grades via essential entries

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F19%3A73595298" target="_blank" >RIV/61989592:15310/19:73595298 - isvavai.cz</a>

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Factorization of matrices with grades via essential entries

Popis výsledku v původním jazyce

We present new results regarding the problem of factorization of matrices with grades, or, equivalently, decomposition of fuzzy relations. In particular, we examine geometry of factorizations and the role of fuzzy concept lattices in factorizations of matrices with grades. The results make it possible to reduce input data and enable a more focused search for factors in the search space, and are intended to guide the design of greedy and other approximation algorithms for the decomposition problem, which itself is NP-hard. To demonstrate usefulness of these results, we propose a new factorization algorithm based on these results. Our experiments demonstrate improvements in the quality of factorizations due to the new approach. We conclude by presenting further research topics implied by our findings.

Název v anglickém jazyce

Factorization of matrices with grades via essential entries

Popis výsledku anglicky

We present new results regarding the problem of factorization of matrices with grades, or, equivalently, decomposition of fuzzy relations. In particular, we examine geometry of factorizations and the role of fuzzy concept lattices in factorizations of matrices with grades. The results make it possible to reduce input data and enable a more focused search for factors in the search space, and are intended to guide the design of greedy and other approximation algorithms for the decomposition problem, which itself is NP-hard. To demonstrate usefulness of these results, we propose a new factorization algorithm based on these results. Our experiments demonstrate improvements in the quality of factorizations due to the new approach. We conclude by presenting further research topics implied by our findings.

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í

2019

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

FUZZY SETS AND SYSTEMS

ISSN

0165-0114

e-ISSN

—

Svazek periodika

360

Číslo periodika v rámci svazku

APR

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

20

Strana od-do

97-116

Kód UT WoS článku

000458860100006

EID výsledku v databázi Scopus

2-s2.0-85049935897