Fast algorithm for computation of the Duquenne-Guigues basis

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F21%3A73607812" target="_blank" >RIV/61989592:15310/21:73607812 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S002002552100445X" target="_blank" >https://www.sciencedirect.com/science/article/pii/S002002552100445X</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ins.2021.04.104" target="_blank" >10.1016/j.ins.2021.04.104</a>

Result language
angličtina
Original language name
Fast algorithm for computation of the Duquenne-Guigues basis
Original language description
We propose and evaluate a novel algorithm for computation of the Duquenne-Guigues basis which combines Close-by-One and LinClosure algorithms. This combination enables us to reuse attribute counters used in LinClosure and speed up the computation. Our experimental evaluation shows that it is the most efficient algorithm for computation of the Duquenne-Guigues basis.
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
S - Specificky vyzkum na vysokych skolach<br>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)