Anis Najar
ABSTRACT
Models of information diffusion and propagation over large social media usually rely on a Close World Assumption: information can only propagate onto the network relational structure, it cannot come from external sources, the network structure is supposed fully known by the model. These assumptions are nonrealistic for many propagation processes extracted from Social Websites. We address the problem of predicting information propagation when the network diffusion structure is unknown and without making any closed world assumption. Instead of modeling a diffusion process, we propose to directly predict the final propagation state of the information over a whole user set. We describe a general model, able to learn predicting which users are the most likely to be contaminated by the information knowing an initial state of the network. Different instances are proposed and evaluated on artificial datasets.
- Meeyoung Cha, Hamed Haddadi, Fabricio Benevenuto, and Krishna P. Gummadi. Measuring User Influence in Twitter: The Million Follower Fallacy. In In Proceedings of the 4th International AAAI Conference on Weblogs and Social Media (ICWSM).Google Scholar
- Wei Chen, Alex Collins, Rachel Cummings, Te Ke, Zhenming Liu, David Rincón, Xiaorui Sun, Yajun Wang, Wei Wei, and Yifei Yuan. Influence maximization in social networks when negative opinions may emerge and propagate. In SDM, pages 379--390, 2011.Google ScholarCross Ref
- David Kempe, Jon Kleinberg, and Éva 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 - KDD '03, page 137, New York, New York, USA, August 2003. ACM Press. Google ScholarDigital Library
- Masahiro Kimura, Kazumi Saito, Kouzou Ohara, and Hiroshi Motoda. Learning information diffusion model in a social network for predicting influence of nodes. Intell. Data Anal., 15(4):633--652, 2011. Google ScholarDigital Library
- Christopher D. Manning, Prabhakar Raghavan, and Hinrich Schütze. Introduction to information retrieval. Cambridge University Press, 2008. Google ScholarDigital Library
- Seth A. Myers and Jure Leskovec. On the convexity of latent social network inference. In NIPS, pages 1741--1749, 2010.Google Scholar
- Manuel Gomez Rodriguez, David Balduzzi, and Bernhard Schölkopf. Uncovering the temporal dynamics of diffusion networks. In Lise Getoor and Tobias Scheffer, editors, Proceedings of the 28th International Conference on Machine Learning (ICML-11), ICML '11, pages 561--568, New York, NY, USA, June 2011. ACM.Google Scholar
- Kazumi Saito, Ryohei Nakano, and Masahiro Kimura. Prediction of information diffusion probabilities for independent cascade model. In KES (3), pages 67--75, 2008. Google ScholarDigital Library
- Kazumi Saito, Kouzou Ohara, Yuki Yamagishi, Masahiro Kimura, and Hiroshi Motoda. Learning diffusion probability based on node attributes in social networks. In Marzena Kryszkiewicz, Henryk Rybinski, Andrzej Skowron, and Zbigniew W. Ras, editors, ISMIS, volume 6804 of Lecture Notes in Computer Science, pages 153--162. Springer, 2011. Google ScholarDigital Library
- Jaewon Yang and Jure Leskovec. Modeling information diffusion in implicit networks. In ICDM, pages 599--608, 2010. Google ScholarDigital Library
Index Terms
- Predicting information diffusion on social networks with partial knowledge
Recommendations
Learning social network embeddings for predicting information diffusion
WSDM '14: Proceedings of the 7th ACM international conference on Web search and data miningAnalyzing and modeling the temporal diffusion of information on social media has mainly been treated as a diffusion process on known graphs or proximity structures. The underlying phenomenon results however from the interactions of several actors and ...
Diffusion in Social and Information Metworks: Research Problems; Probabilistic Models & Machine Learning Methods
WWW '15 Companion: Proceedings of the 24th International Conference on World Wide WebIn recent years, there has been an increasing effort on developing realistic models, and learning and inference algorithms to understand, predict, and influence diffusion over networks. This has been in part due to the increasing availability and ...
Centrality, gossip, and diffusion of information in networks
EC '14: Proceedings of the fifteenth ACM conference on Economics and computationHow can we identify the most influential nodes in a network for initiating diffusion? Are people able to easily identify those people in their communities who are best at spreading information, and if so How? Using theory and recent data, we will ...
Comments