Searcharxiv⌕ Search

arXiv subjects

Radek Janostik

Publications and source records attributed to Radek Janostik.

2 recordsLinked to original sources
arXiv2021

LCM from FCA Point of View: A CbO-style Algorithm with Speed-up Features

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 exactly intents of formal concepts in Formal Concept Analysis (FCA). We describe LCM in terms of FCA and show that LCM is basically the Close-by-One algorithm with multiple speed-up features for processing sparse data. We analyze the speed-up features and compare them with those of similar FCA algorithms, like FCbO and algorithms from the In-Close family.

cs.DS↗
arXiv2021

LinCbO: fast algorithm for computation of the Duquenne-Guigues basis

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 attribute counters used in LinClosure and speed up the computation. Our experimental evaluation shows that it is the most efficient algorithm for computation of the Duquenne-Guigues basis.

cs.DS↗