Optimally learning social networks with activations and suppressions
From MaRDI portal
Publication:982645
DOI10.1016/j.tcs.2010.04.008zbMath1190.91130OpenAlexW2161823072MaRDI QIDQ982645
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
Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning large-alphabet and analog circuits with value injection queries
- Identification of genetic networks by strategic gene disruptions and gene overexpressions under a Boolean model.
- When won't membership queries help?
- Optimally Learning Social Networks with Activations and Suppressions
- An analysis of approximations for maximizing submodular set functions—I
- Cryptographic limitations on learning Boolean formulae and finite automata
- Cryptographic hardness of distribution-specific learning
- Automata, Languages and Programming
- Learning a circuit by injecting values