Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
LinCbO: fast algorithm for computation of the Duquenne-Guigues basis
Radek Janostik, Jan Konecny, Petr Krajča
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…
cs.DS2020
LCM from FCA Point of View: A CbO-style Algorithm with Speed-up Features
Radek Janostik, Jan Konecny, Petr Krajča
LCM is an algorithm for enumeration of frequent closed itemsets in transaction databases. It is well known that when we ignore the required frequency, the closed itemsets are exact…