Paper Info
Title
Lincbo: Fast Algorithm For Computation Of The Duquenne-Guigues Basis
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. (c) 2021 Elsevier Inc. All rights reserved.
Year
DOI
Venue
2021
10.1016/j.ins.2021.04.104
INFORMATION SCIENCES
Keywords
DocType
Volume
non-redundancy, &nbsp, attribute implications, minimalization, closures
Journal
572
ISSN
Citations 
PageRank 
0020-0255
0
0.34
References 
Authors
0
3
Name
Order
Citations
PageRank
Radek Janostik100.34
Jan Konecny211517.20
Petr Krajca3809.47