4 papers
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…
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…
Note on Representing attribute reduction and concepts in concepts lattice using graphs
Jan Konecny
Mao H. (2017, Representing attribute reduction and concepts in concept lattice using graphs. Soft Computing 21(24):7293--7311) claims to make contributions to the study of reductio…
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…