Optimally learning social networks with activations and suppressions
type: Item
instance of: scholarly article
title: Optimally learning social networks with activations and suppressions
zbMATH Open document ID: 1190.91130
author: Dana Angluin
author: James Aspnes
author: Lev Reyzin
published in: Theoretical Computer Science
publication date: 2010-07-07T00:00:00Z
Mathematics Subject Classification ID: 91D30
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5731724
zbMATH Keywords: value injection queries
zbMATH Keywords: social networks
zbMATH Keywords: active learning
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.04.008
OpenAlex ID: W2161823072
cites work: Identification of genetic networks by strategic gene disruptions and gene overexpressions under a Boolean model.
cites work: Learning acyclic probabilistic circuits using test paths
cites work: Learning large-alphabet and analog circuits with value injection queries
cites work: Learning a circuit by injecting values
cites work: Optimally Learning Social Networks with Activations and Suppressions
cites work: When won't membership queries help?
cites work: Cryptographic limitations on learning Boolean formulae and finite automata
cites work: Automata, Languages and Programming
cites work: Cryptographic hardness of distribution-specific learning
cites work: An analysis of approximations for maximizing submodular set functions—I
cites work: Q4527015
cites work: Q4115333
cites work: Q4228498
DOI: 10.1016/J.TCS.2010.04.008
description: scientific article; zbMATH DE number 5731724