Optimally learning social networks with activations and suppressions
From MaRDI portal
Publication:982645
DOI10.1016/J.TCS.2010.04.008zbMATH Open1190.91130OpenAlexW2161823072MaRDI QIDQ982645FDOQ982645
Authors: Dana Angluin, James Aspnes, Lev Reyzin
Publication date: 7 July 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.04.008
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automata, Languages and Programming
- An analysis of approximations for maximizing submodular set functions—I
- When won't membership queries help?
- Identification of genetic networks by strategic gene disruptions and gene overexpressions under a Boolean model.
- Cryptographic limitations on learning Boolean formulae and finite automata
- Title not available (Why is that?)
- Cryptographic hardness of distribution-specific learning
- Learning large-alphabet and analog circuits with value injection queries
- Learning acyclic probabilistic circuits using test paths
- Optimally Learning Social Networks with Activations and Suppressions
- Learning a circuit by injecting values
Cited In (4)
This page was built for publication: Optimally learning social networks with activations and suppressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q982645)