Attribute-efficient learning of Boolean functions from Post closed classes

DOI10.1515/DMA-2020-0025MaRDI QIDQ828191zbMATHOpenAlexFDO

Authors Anastasiya V. Bistrigova

Publication date 8 January 2021

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma-2020-0025

zbMATH Keywords

membership queriesexact learningattribute-efficient learningbinary covering arrayPost lattice of closed classes

Mathematics Subject Classification ID

Computational learning theory (68Q32) Boolean functions (06E30)

Cites work

• scientific article; zbMATH DE number 4049910 (Why is no real title available?)
• scientific article; zbMATH DE number 3441975 (Why is no real title available?)
• scientific article; zbMATH DE number 3304025 (Why is no real title available?)
• A survey of binary covering arrays
• A survey of methods for constructing covering arrays
• Adaptive versus nonadaptive attribute-efficient learning
• Cardinality of generating sets for operations from the Post lattice classes
• Covering arrays and intersecting codes
• Families of \(k\)-independent sets
• Minimax Rendezvous on the Line
• On learning monotone Boolean functions with irrelevant variables
• On parallel attribute-efficient learning.
• Oracles and queries that are sufficient for exact learning
• Queries and concept learning
• Rendezvous Search on the Line
• Sperner capacities
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)

Cited in

(1)

• Learning of bounded-weight Boolean functions

Describes a project that uses

Uses Software

• AETG

This page was built for publication: Attribute-efficient learning of Boolean functions from Post closed classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828191)