Attribute-efficient learning of Boolean functions from Post closed classes
Diskretnaya Matematika, Tome 31 (2019) no. 2, pp. 34-56
Voir la notice de l'article provenant de la source Math-Net.Ru
We consider exact attribute-efficient learning of functions from Post closed classes using membership queries and obtain bounds on learning complexity.
Keywords:
exact learning, attribute-efficient learning, membership queries, Post lattice of closed classes, binary covering array.
@article{DM_2019_31_2_a3,
author = {A. V. Bistrigova},
title = {Attribute-efficient learning of {Boolean} functions from {Post} closed classes},
journal = {Diskretnaya Matematika},
pages = {34--56},
publisher = {mathdoc},
volume = {31},
number = {2},
year = {2019},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_2019_31_2_a3/}
}
A. V. Bistrigova. Attribute-efficient learning of Boolean functions from Post closed classes. Diskretnaya Matematika, Tome 31 (2019) no. 2, pp. 34-56. http://geodesic.mathdoc.fr/item/DM_2019_31_2_a3/