LinCbO: fast algorithm for computation of the Duquenne-Guigues basis
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 10 Nov 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 1.
1 paper.