AI Chat AI Image Generator AI Video Text to Speech

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

11/10/2020

∙

by Radek Janostik, et al.

∙

∙

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.

Radek Janostik
2 publications
Jan Konecny
3 publications
Petr Krajča
2 publications

research

∙ 08/12/2019

An Efficient Skyline Computation Framework

Skyline computation aims at looking for the set of tuples that are not w...

0 Rui Liu, et al. ∙

research

∙ 02/12/2021

User manual for bch, a program for the fast computation of the Baker-Campbell-Hausdorff and similar series

This manual describes bch, an efficient program written in the C program...

0 Harald Hofstätter, et al. ∙

research

∙ 09/25/2022

Accelerating the Convex Hull Computation with a Parallel GPU Algorithm

The convex hull is a fundamental geometrical structure for many applicat...

0 Alan Keith, et al. ∙

research

∙ 11/20/2018

Gen-Oja: A Simple and Efficient Algorithm for Streaming Generalized Eigenvector Computation

In this paper, we study the problems of principal Generalized Eigenvecto...

0 Kush Bhatia, et al. ∙

research

∙ 07/18/2017

On the Computation of Neumann Series

This paper proposes new factorizations for computing the Neumann series....

0 Vassil Dimitrov, et al. ∙

research

∙ 09/29/2020

Fast Fréchet Inception Distance

The Fréchet Inception Distance (FID) has been used to evaluate thousands...

17 Alexander Mathiasen, et al. ∙

research

∙ 07/14/2022

Efficient One Sided Kolmogorov Approximation

We present an efficient algorithm that, given a discrete random variable...

0 Liat Cohen, et al. ∙