Cited By
View all- Saxena ASaxena PReddy H(2021)Fake News Propagation and Mitigation Techniques: A SurveyPrinciples of Social Networking10.1007/978-981-16-3398-0_16(355-386)Online publication date: 19-Aug-2021
Preventing the diffusion of negative information based on local influence tree
Authors: 
Li Yang, Sha Ying, Shan Jixi, Jiang Bo, Wu JianjunAuthors Info & Claims
Pages 650 - 652
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.
References
[1]
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.
[2]
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.
[3]
C. Budak, D. Agrawal, A. E. Abbadi. Limiting the spread of misinformation in social networks. In WWW, pages 665--674, 2011.
[4]
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.
[5]
X. He, G. Song, W. Chen, Q. Jiang. Influence Blocking Maximization in Social Networks under the Competitive Linear Threshold Model. arXiv:1110.4723, 2011.
[6]
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.
[7]
Prakas, et al. Winner-takes-all: Competing Viruses on fair-play networks. WWW 2012, pages 1037--1046.ACM.
[8]
Beutel, et al. Interacting Viruses on a Network: Can both survive? SIGKDD 2012, pages: 426--434. ACM
[9]
A. Singh, Y. N. Singh. Rumor Spreading and Inoculation of Nodes in Complex Networks. WWW 2012, pages 675--678. ACM.
[10]
High Energy Physics {EB/OL} http://www.arxiv.org/archive/hep, 2003.
[11]
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.
[12]
Barthelemy M. Betweeness centrality in large complex network{J}. European Physical Journal B, 2004, 38(1434): 163--168.
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
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
March 2014
1890 pages
ISBN:9781450324694
DOI:10.1145/2554850
- Conference Chairs:
- Yookun Cho,
- Sung Y. Shin,
- Program Chairs:
- Sangwook Kim,
- Chih-Cheng Hung,
- Jiman Hong
Copyright © 2014 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: 24 March 2014
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Chinese Academy of Sciences
- National Natural Science Foundation of China
- National Key Technology R&D Program
Conference
SAC 2014
Sponsor:
Acceptance Rates
SAC '14 Paper Acceptance Rate 218 of 939 submissions, 23%;
Overall Acceptance Rate 1,650 of 6,669 submissions, 25%
Upcoming Conference
SAC '25
- Sponsor:
- sigapp
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 96Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Jan 2025
Other Metrics
Citations
Cited By
View all- Saxena ASaxena PReddy H(2021)Fake News Propagation and Mitigation Techniques: A SurveyPrinciples of Social Networking10.1007/978-981-16-3398-0_16(355-386)Online publication date: 19-Aug-2021
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in