On the usability of probably approximately correct implication bases
From MaRDI portal
Publication:2399919
DOI10.1007/978-3-319-59271-8_5zbMath1489.68268arXiv1701.00877OpenAlexW2570421750WikidataQ62046316 ScholiaQ62046316MaRDI QIDQ2399919
Sergei Obiedkov, Daniel Borchmann, Tom Hanika
Publication date: 25 August 2017
Full work available at URL: https://arxiv.org/abs/1701.00877
Related Items (3)
Formal Methods in FCA and Big Data ⋮ From equivalence queries to PAC learning: the case of implication theories ⋮ Approximate computation of exact association rules
This page was built for publication: On the usability of probably approximately correct implication bases