LinCbO: fast algorithm for computation of the Duquenne-Guigues basis
Radek Janostik, Jan Konecny, Petr Kraj\v{c}a
TL;DR
This paper introduces LinCbO, a new algorithm that combines existing methods to efficiently compute the Duquenne-Guigues basis, significantly improving performance in formal concept analysis.
Contribution
The paper presents a novel algorithm that merges Close-by-One and LinClosure techniques to enhance computation speed of the Duquenne-Guigues basis.
Findings
Most efficient algorithm for Duquenne-Guigues basis computation
Significant speed-up demonstrated through experiments
Effective reuse of attribute counters in the combined approach
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.