Li Yang
ABSTRACT
In the social network, competitive influence spread is the problem of finding positive seed vertices that propagate information so as to minimize the influence spread of negative vertices. However, the existing heuristic methods need to be further improved. Therefore, we devote to prevent the diffusion of negative information under the competitive independent cascade (CIC) model. In this paper, we propose a new way to tackle the competitive influence problem, referred to as local influence tree (LIT). We carry out experiments on the real-world datasets, the experiments have verified the effectiveness of the proposed methods compared to the baseline methods.
- S. Bharathi, D. Kempe, M. Salek. Competitive influence maximization in social networks. In Proc. 3rd International Workshop on Internet and Network Economics (WINE), pages 306--311, 2007. Google Scholar
Digital Library
- T. Carnes, C. Nagarajan, S. M. Wild, and A. van Zuylen. Maximizing influence in a competitive social network: a follower's perspective. In ICEC'07, pages 351--360, New York, NY, USA, 2007. ACM. Google ScholarDigital Library
- C. Budak, D. Agrawal, A. E. Abbadi. Limiting the spread of misinformation in social networks. In WWW, pages 665--674, 2011. Google ScholarDigital Library
- A. Borodin, Y. Filmus, J. Oren. Threshold models for competitive influence in social networks. In Proc. 6th International Workshop on Internet and Network Economics (WINE 2010), pages 539--550, 2010. Google ScholarDigital Library
- X. He, G. Song, W. Chen, Q. Jiang. Influence Blocking Maximization in Social Networks under the Competitive Linear Threshold Model. arXiv:1110.4723, 2011.Google Scholar
- M. Kitsak, L. K. Gallos, S. Havlin, F. Liljeros, L. Muchnik, H. E. Stanley, and H. A. Makse. Identifying influential spreaders in complex networks. Jan 2010.Google Scholar
- Prakas, et al. Winner-takes-all: Competing Viruses on fair-play networks. WWW 2012, pages 1037--1046.ACM. Google ScholarDigital Library
- Beutel, et al. Interacting Viruses on a Network: Can both survive? SIGKDD 2012, pages: 426--434. ACM Google ScholarDigital Library
- A. Singh, Y. N. Singh. Rumor Spreading and Inoculation of Nodes in Complex Networks. WWW 2012, pages 675--678. ACM. Google ScholarDigital Library
- High Energy Physics {EB/OL} http://www.arxiv.org/archive/hep, 2003.Google Scholar
- W. Chen, Y. Wang, and S. Yang. Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD conference on Knowledge Discovery and Data Mining, 2009: 199--208. Google ScholarDigital Library
- Barthelemy M. Betweeness centrality in large complex network{J}. European Physical Journal B, 2004, 38(1434): 163--168.Google Scholar
Index Terms
- Preventing the diffusion of negative information based on local influence tree
Recommendations
Analyzing patterns of information cascades based on users' influence and posting behaviors
TempWeb '12: Proceedings of the 2nd Temporal Web Analytics WorkshopNowadays people can share useful information on social networking sites such as Facebook and Twitter. The information is spread over the networks when it is forwarded or copied repeatedly from friends to friends. This phenomenon is so called "...
Influence Diffusion Detection Using Blogger's Influence Style
ICADL 2013: Proceedings of the 15th International Conference on Digital Libraries: Social Media and Community Networks - Volume 8279Previous studies on detecting blogosphere influence diffusion had used blog features such as in-degree and sentiment links. The approaches in most of these studies assumed that influence increases with the number of links and largely ignored the ...
Measuring Spatial Influence of Twitter Users by Interactions
LENS'17: Proceedings of the 1st ACM SIGSPATIAL Workshop on Analytics for Local Events and NewsThe three ways of interactions in Twitter--retweet, reply, and mention--comprise of a latent dynamic information flow network between users, which can be utilized to determine influential users. This paper focuses on determining which Twitter users have ...
Comments