3 papers
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…
cs.LO2015
Complete relations on fuzzy complete lattices
Jan Konecny, Michal Krupka
We generalize the notion of complete binary relation on complete lattice to residuated lattice valued ordered sets and show its properties. Then we focus on complete fuzzy toleranc…