Optimally learning social networks with activations and suppressions

Optimally learning social networks with activations and suppressions

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Dana Angluin , James Aspnes , Lev Reyzin

Venue:	In ALT (2008
Citations:	5 - 5 self

BibTeX

@INPROCEEDINGS{Angluin_optimallylearning,
    author = {Dana Angluin and James Aspnes and Lev Reyzin},
    title = {Optimally learning social networks with activations and suppressions},
    booktitle = {In ALT (2008},
    year = {},
    pages = {272--286}
}

Bookmark

OpenURL

Abstract

Abstract. In this paper we consider the problem of learning hidden independent cascade social networks using exact value injection queries. These queries involve activating and suppressing agents in the target network. We develop an algorithm that optimally learns an arbitrary social network of size n using O(n 2) queries, matching the information theoretic lower bound we prove for this problem. We also consider the case when the target social network forms a tree and show that the learning problem takes Θ(n log(n)) queries. We also give an approximation algorithm for finding an influential set of nodes in the network, without resorting to learning its structure. Finally, we discuss some limitations of our approach, and limitations of path-based methods, when non-exact value injection queries are used. 1

Citations

290	Principles of Mathematical Analysis - Rudin - 1976
279	Cryptographic limitations on learning boolean formulae and finite automata - Kearns, Valiant - 1994
252	An analysis of the approximations for maximizing submodular set functions - Nemhauser, Wosley, et al. - 1978
206	A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP - Raz, Safra
107	When won’t membership queries help - Angluin, Kharitonov - 1991
69	Cryptographic hardness of distribution-specific learning - Kharitonov - 1993
64	A tight analysis of the greedy algorithm for set cover - Slavik - 1997
63	Discovery of regulatory interactions through perturbation: Inference and experimental design - Ideker, Thorsson, et al. - 2000
51	Identification of gene regulatory networks by strategic gene disruptions and gene overexpressions - Akutsu, Kuahara, et al. - 1998
47	Influential nodes in a diffusion model for social networks - Kempe, Kleinberg, et al. - 2005
42	Kleinberg and Eva Tardos, “Maximizing the Spread of Influence through a Social Network - Kempe, Jon - 2003
15	Using complex systems analysis to advance marketing theory development: Modeling heterogeneity effects on new product growth through stochastic cellular automata. Academy of Marketing Science Review, 2001. [Gra78] M. Granovetter. Threshold models of colle - Goldenberg, Libai, et al. - 1978
11	Identification of genetic networks by strategic gene disruptions and gene overexpressions under a boolean model - Akutsu, Kuhara, et al.
8	Learning large-alphabet and analog circuits with value injection queries - Angluin, Aspnes, et al.
8	Learning a circuit by injecting values - Angluin, Aspnes, et al. - 2006
3	Learning acyclic probabilistic circuits using test paths - Angluin, Aspnes, et al. - 2008