Approximate computation of exact association rules
type: Item
instance of: scholarly article
title: Approximate computation of exact association rules
DOI: 10.1007/978-3-030-77867-5_7
author: Saurabh Bansal
author: Sriram Kailasam
author: Sergei Obiedkov
publication date: 2022-03-21T00:00:00Z
Mathematics Subject Classification ID: 68T30
zbMATH DE Number: 7493555
zbMATH Keywords: association rule
zbMATH Keywords: implication
zbMATH Keywords: PAC learning
describes a project that uses: UCI-ml
MaRDI profile type: Publication
full work available at URL: 978-3-030-77867-5 7
OpenAlex ID: W3173743893
cites work: Queries and concept learning
cites work: Learning conjunctions of Horn clauses
cites work: Construction and learnability of canonical Horn formulas
cites work: Optimizations in computing the Duquenne-Guigues basis of implications
cites work: On the usability of probably approximately correct implication bases
cites work: Probably approximately correct learning of Horn envelopes from queries
cites work: Two Basic Algorithms in Concept Analysis
cites work: Conceptual Exploration
cites work: Q4230685
cites work: Q5058462
cites work: Horn approximations of empirical data
cites work: Q4871262
cites work: Q5429564
cites work: Attribute-incremental construction of the canonical implication basis
cites work: Learning implications from data and from queries
cites work: From equivalence queries to PAC learning: the case of implication theories
description: scientific article; zbMATH DE number 7493555