Lincbo: Fast Algorithm For Computation Of The Duquenne-Guigues Basis
INFORMATION SCIENCES(2021)
摘要
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.
更多查看译文
关键词
non-redundancy,  , attribute implications, minimalization, closures
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要