research-article

Choosing which message to publish on social networks: a contextual bandit approach

Authors:

Ludovic Denoyer,

Patrick Gallinari,

Peter DologAuthors Info & Claims

ASONAM '13: Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining

Pages 620 - 627

https://doi.org/10.1145/2492517.2492541

Published: 25 August 2013 Publication History

Abstract

Maximizing the spread and influence of the messages being published is a challenge for many social network users. Selecting the right content according to the information context and the user characteristics is essential for achieving this goal. We propose a model to automatically choose which information to publish on social networks given a set of possible messages. This model will tend to maximize the spread of the published message for a specific audience. The algorithm is based on the use of a contextual bandit model treating each new potential message as an arm to be selected. We conduct experiments on a Twitter dataset, comparing different algorithms and exploring the influence of the content and the characteristics of the messages on the information spread. The results demonstrate the model's ability to maximize the published information flow as well as it's ability to adapt its behavior to each particular audience.

References

[1]

Q. Jones, G. Ravid, and S. Rafaeli, "Information overload and the message dynamics of online interaction spaces: A theoretical model and empirical exploration," Information systems research, vol. 15, no. 2, pp. 194--210, 2004.

Digital Library

[2]

L. Boratto and S. Carta, "State-of-the-art in group recommendation and new approaches for automatic identification of groups," in Information Retrieval and Mining in Distributed Environments, ser. Studies in Computational Intelligence, A. Soro, E. Vargiu, G. Armano, and G. Paddeu, Eds. Springer Berlin / Heidelberg, 2011, vol. 324, pp. 1--20.

[3]

S. Wu, J. M. Hofman, W. A. Mason, and D. J. Watts, "Who says what to whom on twitter," in Proceedings of the 20th international conference on World wide web, ser. WWW '11. New York, NY, USA: ACM, 2011, p. 705714. {Online}. Available: http://doi.acm.org.zorac.aub.aau.dk/10.1145/1963405.1963504

Digital Library

[4]

K. Chen, T. Chen, G. Zheng, O. Jin, E. Yao, and Y. Yu, "Collaborative personalized tweet recommendation," in Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval, ser. SIGIR '12. New York, NY, USA: ACM, 2012, pp. 661--670. {Online}. Available: http://doi.acm.org/10.1145/2348283.2348372

Digital Library

[5]

J. Lin and G. Mishne, "A study of "Churn" in tweets and real-time search queries," in Sixth International AAAI Conference on Weblogs and Social Media, May 2012. {Online}. Available: http://www.aaai.org/ocs/index.php/ICWSM/ICWSM12/paper/view/4599

[6]

J. Masthoff and A. Gatt, "In pursuit of satisfaction and the prevention of embarrassment: affective state in group recommender systems," User Modeling and User-Adapted Interaction, vol. 16, no. 3--4, pp. 281--319, 2006.

Digital Library

[7]

W. Chu and S.-T. Park, "Personalized recommendation on dynamic content using predictive bilinear models," in Proceedings of the 18th international conference on World wide web, ser. WWW '09. New York, NY, USA: ACM, 2009, p. 691700. {Online}. Available: http://doi.acm.org/10.1145/1526709.1526802

Digital Library

[8]

J. Bento, S. Ioannidis, S. Muthukrishnan, and J. Yan, "Group recommendations via multi-armed bandits," in Proceedings of the 21st international conference companion on World Wide Web, ser. WWW'12 Companion. New York, NY, USA: ACM, 2012, p. 463464.

Digital Library

[9]

R. S. S. Barto and A. G., "Reinforcement learning: An introduction," 1998.

[10]

L. Li, W. Chu, J. Langford, and R. E. Schapire, "A contextual-bandit approach to personalized news article recommendation," in Proceedings of the 19th international conference on World wide web, ser. WWW '10. New York, NY, USA: ACM, 2010, pp. 661--670.

Digital Library

[11]

H. Robbins, "Some aspects of the sequential design of experiments," Bulletin of the American Mathematical Society, vol. 58, no. 5, pp. 527--536, Sep. 1952. {Online}. Available: http://libra.msra.cn/Publication/1355692/some-aspects-of-the-sequential-design-of-experiments

[12]

J. Langford and T. Zhang, "The epoch-greedy algorithm for multi-armed bandits with side information," 2007. {Online}. Available: http://dblp.uni-trier.de/rec/bibtex/conf/nips/LangfordZ07

[13]

O. Chapelle and L. V. Li, "An empirical evaluation of thompson sampling," in 25th Annu. Conf. on Neural Information Processing Systems, NIPS, Granada, Spain, 2011.

[14]

D. Russo and B. V. Roy, "Learning to optimize via posterior sampling," CoRR, vol. abs/1301.2609, 2013.

[15]

S. Agrawal and N. Goyal, "Thompson sampling for contextual bandits with linear payoffs," arXiv preprint arXiv:1209.3352, 2012.

[16]

H. Kwak, C. Lee, H. Park, and S. Moon, "What is twitter, a social network or a news media?" in Proceedings of the 19th international conference on World wide web. Raleigh, North Carolina, USA: ACM, 2010, pp. 591--600. {Online}. Available: http://portal.acm.org/citation.cfm?id=1772690.1772751

Digital Library

[17]

R. Lage, F. Durao, and P. Dolog, "Towards effective group recommendations for microblogging users," in Proceedings of the 27th Annual ACM Symposium on Applied Computing, ser. SAC '12. New York, NY, USA: ACM, 2012, pp. 923--928.

Digital Library

[18]

S. Wang, X. Zhou, Z. Wang, and M. Zhang, "Please spread." ACM Press, 2012, p. 19. {Online}. Available: http://dl2.acm.org/citation.cfm?id=2390140

[19]

A. Borodin, Y. Filmus, and J. Oren, "Threshold models for competitive influence in social networks," in Proceedings of the 6th international conference on Internet and network economics, ser. WINE'10. Berlin, Heidelberg: Springer-Verlag, 2010, pp. 539--550.

Digital Library

[20]

D. Kempe, J. Kleinberg, and É. Tardos, "Maximizing the spread of influence through a social network," in Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2003, pp. 137--146.

Digital Library

[21]

A. Guille and H. Hacid, "A predictive model for the temporal dynamics of information diffusion in online social networks," in Proceedings of the 21st international conference companion on World Wide Web, ser. WWW '12 Companion. New York, NY, USA: ACM, 2012, pp. 1145--1152.

Digital Library

[22]

C. Lagnier, L. Denoyer, E. Gaussier, and P. Gallinari, "Predicting information diffusion in social netorks using content and users profiles," in 35th European Conference on Information Retrieval, 2013.

Digital Library

[23]

S. Nikolov and D. Shah, "A nonparametric method for early detection of trending topics," 2012.

[24]

J. Ginsberg, M. H. Mohebbi, R. S. Patel, L. Brammer, M. S. Smolinski, and L. Brilliant, "Detecting influenza epidemics using search engine query data," Nature, vol. 457, no. 7232, pp. 1012--1014, 2008.

[25]

J. Bollen, H. Mao, and X. Zeng, "Twitter mood predicts the stock market," Journal of Computational Science, vol. 2, no. 1, pp. 1--8, 2011.

[26]

L. Li, W. Chu, J. Langford, and X. Wang, "Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms," in Proceedings of the fourth ACM international conference on Web search and data mining, ser. WSDM '11. New York, NY, USA: ACM, 2011, pp. 297--306.

Digital Library

Cited By

Odeyomi O(2020)Learning the Truth in Social Networks Using Multi-Armed BanditIEEE Access10.1109/ACCESS.2020.30125938(137692-137701)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.3012593
Lamprier SGisselbrecht TGallinari P(2019)Contextual bandits with hidden contexts: a focused data capture from social media streamsData Mining and Knowledge Discovery10.1007/s10618-019-00648-wOnline publication date: 10-Aug-2019
https://doi.org/10.1007/s10618-019-00648-w
Gisselbrecht TLamprier SGallinari P(2015)Policies for Contextual Bandit Problems with Count PayoffsProceedings of the 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI)10.1109/ICTAI.2015.85(542-549)Online publication date: 9-Nov-2015
https://dl.acm.org/doi/10.1109/ICTAI.2015.85

Index Terms

Choosing which message to publish on social networks: a contextual bandit approach

Recommendations

Message diffusion through social network service: The case of rumor and non-rumor related tweets during Boston bombing 2013

Social Network Services (SNS) such as Twitter play a significant role in reporting media, particularly during the extreme events. We examined the impact of tweet features on the diffusion of two types of messages during 2013 Boston marathon tragedy--...
Contagion dynamics of extremist propaganda in social networks

Recent terrorist attacks carried out on behalf of ISIS on American and European soil by lone wolf attackers or sleeper cells remind us of the importance of understanding the dynamics of radicalization mediated by social media communication channels. In ...
Analysis of misinformation containment in online social networks

With their blistering expansion in recent years, popular online social sites such as Twitter, Facebook and Bebo, have become not only one of the most effective channels for viral marketing but also the major news sources for many people nowadays. ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ASONAM '13: Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining

August 2013

1558 pages

ISBN:9781450322409

DOI:10.1145/2492517

General Chairs:
Jon Rokne
University of Calgary, Calgary, AB, Canada
,
Christos Faloutsos
Carnegie Mellon University, Pittsburgh, PA

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 August 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

ASONAM '13

Sponsor:

SIGKDD

ASONAM '13: Advances in Social Networks Analysis and Mining 2013

August 25 - 28, 2013

Ontario, Niagara, Canada

Acceptance Rates

Overall Acceptance Rate 116 of 549 submissions, 21%

Upcoming Conference

KDD '24

Sponsor:
sigkdd
sigkdd

The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining

August 25 - 29, 2024

Barcelona , Spain

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
185
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to

Other Metrics

View Author Metrics

Citations

Cited By

Odeyomi O(2020)Learning the Truth in Social Networks Using Multi-Armed BanditIEEE Access10.1109/ACCESS.2020.30125938(137692-137701)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.3012593
Lamprier SGisselbrecht TGallinari P(2019)Contextual bandits with hidden contexts: a focused data capture from social media streamsData Mining and Knowledge Discovery10.1007/s10618-019-00648-wOnline publication date: 10-Aug-2019
https://doi.org/10.1007/s10618-019-00648-w
Gisselbrecht TLamprier SGallinari P(2015)Policies for Contextual Bandit Problems with Count PayoffsProceedings of the 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI)10.1109/ICTAI.2015.85(542-549)Online publication date: 9-Nov-2015
https://dl.acm.org/doi/10.1109/ICTAI.2015.85

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents