Opinion maximization in social networks

Proceedings of the 2013 SIAM International Conference on Data Mining, SDM 2013

Volumn , Issue , 2013, Pages 387-395

  Gionis, Aristides ^a   Terzi, Evimaria ^b   Tsaparas, Panayiotis ^c  

^a AALTO UNIVERSITY   (Finland)

^b BOSTON UNIVERSITY   (United States)

^c UNIVERSITY OF IOANNINA   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ECONOMICS; SOCIAL NETWORKING (ONLINE); SPACE DIVISION MULTIPLE ACCESS; COMPLEX NETWORKS; DATA MINING;

DESIGN PROBLEMS; INFORMATION ITEMS; KEY CHARACTERISTICS; ON-LINE SOCIAL NETWORKS; OPINION DYNAMICS; OPINION FORMATION; SOCIAL MEDIA; SPECIFIC INFORMATION;

DATA MINING; SOCIAL NETWORKING (ONLINE);

EID: 84960153505     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972832.43     Document Type: Conference Paper

References (22)

1. Benchmark folksonomy data from bibsonomy. Technical report, Knowledge and Data Engineering Group, University of Kassel, 2007.
2. D. Acemoglu and A. Ozdaglar. Opinion dynamics and learning in social networks. Dynamic Games, 2011.
3. D. Bindel, J. M. Kleinberg, and S. Oren. How bad is forming your own opinion? In FOCS, 2011.
4. S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. In WWW, 1998.
5. N. Chen. On the approximability of inuence in social networks. In SODA, 2008.
6. M. H. DeGrout. Reaching consensus. Journal of Maerican Statistical Association, 1974.
7. P. M. DeMarzo, D. Vayanos, and J. Zweibel. Persuasion bias, social inuence, and unidimensional opinions. Quarterly Journal of Economics, 2003.
8. P. Doyle and J. Snell. Random walks and electric networks. Mathematical Association of America, 1984.
9. E. Even-Dar and A. Shapira. A note on maximizing the spread of inuence in social networks. In WINE, 2007.
10. U. Feige. Vertex cover is hardest to approximate on regular graphs. Technical report MCS03-15 of the Weizmann Institute, 2003.
11. N. E. Friedkin and E. Johnsen. Social inuence and opinions. Journal of Mathematical Sociology, 1990.
12. A. Gionis, E. Terzi, and P. Tsaparas. Opinion maximization in social networks. In arXiv:1301.7455, 2013.
13. B. Golub and M. O. Jackson. Naive learning in social networks: Convergence, inuence and the wisdom of the crowds. Amer. Econ. J.: Microeconomics, 2010.
14. M. O. Jackson. Social and Economic Networks. Princeton University Press, 2008.
15. D. Kempe, J. M. Kleinberg, and É. Tardos. Maximizing the spread of inuence through a social network. In KDD, 2003.
16. D. E. Knuth. The Stanford GraphBase: A Platform for Combinatorial Computing. Addison-Wesley, 1993.
17. D. Krackhardt. A plunge into networks. Science, 2009.
18. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. M. VanBriesen, and N. S. Glance. Cost-effective outbreak detection in networks. In KDD, 2007.
19. D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten, and S. M. Dawson. Behavioral Ecology and Sociobiology, 54:396-405, 2003.
20. G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, 1978.
21. M. Richardson and P. Domingos. Mining knowledge-sharing sites for viral marketing. In KDD, 2002.
22. W. W. Zachary. An information ow model for conict and fission in small groups. Journal of Anthropological Research, 33:452-473, 2003.