Pruning techniques in LinCbO for the computation of the Duquenne-Guigues basis

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F22%3A73615079" target="_blank" >RIV/61989592:15310/22:73615079 - isvavai.cz</a>

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Pruning techniques in LinCbO for the computation of the Duquenne-Guigues basis

Popis výsledku v původním jazyce

In our previous work, we introduced LinCbO-an algorithm for fast computation of the Duquenne-Guigues basis based on Close-by-One and LinClosure. We also proposed addi-tional speed-ups using pruning techniques, like those used in FCbO, In-Close, or LCM. In the present work, we describe the pruning techniques for LinCbO and experimentally eval-uate their effect. Additionally, we describe and evaluate algorithms using a similar idea to LinCbO but using naive closure or Wild&apos;s closure instead of the LinClosure. According to our extensive experimental evaluation, LinCbO with pruning techniques performs significantly faster than already known algorithms. The differences between the performance of the four pruning techniques seem negligible.

Název v anglickém jazyce

Pruning techniques in LinCbO for the computation of the Duquenne-Guigues basis

Popis výsledku anglicky

In our previous work, we introduced LinCbO-an algorithm for fast computation of the Duquenne-Guigues basis based on Close-by-One and LinClosure. We also proposed addi-tional speed-ups using pruning techniques, like those used in FCbO, In-Close, or LCM. In the present work, we describe the pruning techniques for LinCbO and experimentally eval-uate their effect. Additionally, we describe and evaluate algorithms using a similar idea to LinCbO but using naive closure or Wild&apos;s closure instead of the LinClosure. According to our extensive experimental evaluation, LinCbO with pruning techniques performs significantly faster than already known algorithms. The differences between the performance of the four pruning techniques seem negligible.

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í

2022

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

INFORMATION SCIENCES

ISSN

0020-0255

e-ISSN

1872-6291

Svazek periodika

616

Číslo periodika v rámci svazku

NOV

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

22

Strana od-do

182-203

Kód UT WoS článku

000880754700011

EID výsledku v databázi Scopus

2-s2.0-85140487193