Average Size of Implicational Bases
Artificial Intelligence
2018-02-13 v1 Computational Complexity
Databases
Combinatorics
Abstract
Implicational bases are objects of interest in formal concept analysis and its applications. Unfortunately, even the smallest base, the Duquenne-Guigues base, has an exponential size in the worst case. In this paper, we use results on the average number of minimal transversals in random hypergraphs to show that the base of proper premises is, on average, of quasi-polynomial size.
Cite
@article{arxiv.1802.04032,
title = {Average Size of Implicational Bases},
author = {Giacomo Kahn and Alexandre Bazin},
journal= {arXiv preprint arXiv:1802.04032},
year = {2018}
}
Comments
CLA, Jun 2018, Olomouc, Czech Republic