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

From MaRDI portal



Abstract: 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.












This page was built for publication: LinCbO: fast algorithm for computation of the Duquenne-Guigues basis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6071284)