Pruning techniques in LinCbO for the computation of the Duquenne-Guigues basis
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Pruning techniques in LinCbO for the computation of the Duquenne-Guigues basis
Original language description
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'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.
Czech name
—
Czech description
—
Classification
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)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
INFORMATION SCIENCES
ISSN
0020-0255
e-ISSN
1872-6291
Volume of the periodical
616
Issue of the periodical within the volume
NOV
Country of publishing house
US - UNITED STATES
Number of pages
22
Pages from-to
182-203
UT code for WoS article
000880754700011
EID of the result in the Scopus database
2-s2.0-85140487193