Optimally Learning Social Networks with Activations and Suppressions

DOI10.1007/978-3-540-87987-9_24zbMATH Open1156.68408OpenAlexW2175284235MaRDI QIDQ3529928FDOQ3529928

Authors: Dana Angluin, James Aspnes, Lev Reyzin 

Publication date: 14 October 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87987-9_24

Recommendations

• Optimally learning social networks with activations and suppressions
• Learning network structures from contagion
• Seeding with costly network information
• Maximizing social influence in nearly optimal time
• On the approximability of influence in social networks

Mathematics Subject Classification ID

Computational learning theory (68Q32) Social networks; opinion dynamics (91D30)

Cited In (4)

• Optimally learning social networks with activations and suppressions
• Network construction with subgraph connectivity constraints
• Robust learning in social networks via matrix scaling
• Actively learning to infer social ties

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 Q3529928)