Liang Wu
Huan Liu
ABSTRACT
Social networks have been instrumental in spreading rumor such as fake news and false rumors. Research in rumor intervention to date has concentrated on launching an intervening campaign to limit the number of infectees. However, many emerging and important tasks focus more onearly intervention. Social and psychological studies have revealed that rumors might evolve 70% of its original content after 6 transmissions. Therefore, ignoring earliness of intervention makes the intervening campaign downgrade rapidly due to the evolved content. In real social networks, the number of social actors is usuallylarge, while the budget for an intervening campaign is relativelysmall. The limited budget makes early intervention particularly challenging. Nonetheless, we present an efficient containment method that promptly terminates the diffusion with least cost. To our knowledge, this work is the first to study the earliness of rumor intervention in a large real-world social network. Evaluations on a network of $3$ million users show that the key social actors who earliest terminate the spread are not necessarily the most influential users or friends of rumor initiators, and the proposed method effectively reduces the life span of rumors.
- Luca Maria Aiello, Alain Barrat, Rossano Schifanella, Ciro Cattuto, Benjamin Markines, and Filippo Menczer. 2012. Friendship prediction and homophily in social media. ACM Transactions on the Web (TWEB), Vol. 6, 2 (2012), 9. Google Scholar
Digital Library
- Gordon W Allport and Leo Postman. 1947. The psychology of rumor. (1947).Google Scholar
- Despoina Antonakaki, Iasonas Polakis, Elias Athanasopoulos, Sotiris Ioannidis, and Paraskevi Fragopoulou. 2016. Exploiting abused trending topics to identify spam campaigns in Twitter. Social Network Analysis and Mining, Vol. 6, 1 (2016), 1--11.Google ScholarCross Ref
- Fabricio Benevenuto, Tiago Rodrigues, Virgilio Almeida, Jussara Almeida, Chao Zhang, and Keith Ross. Identifying video spammers in online social networks. In International Workshop on Adversarial Information Retrieval on the Web. ACM, 45--52. Google ScholarDigital Library
- Alessandro Bessi, Fabio Petroni, Michela Del Vicario, Fabiana Zollo, Aris Anagnostopoulos, Antonio Scala, Guido Caldarelli, and Walter Quattrociocchi. 2015. Viral misinformation: The role of homophily and polarization. In Proceedings of the 24th International Conference on World Wide Web. ACM, 355--356. Google ScholarDigital Library
- Allan Borodin, Yuval Filmus, and Joel Oren. 2010. Threshold models for competitive influence in social networks. In International Workshop on Internet and Network Economics. Springer, 539--550. Google ScholarDigital Library
- Ceren Budak, Divyakant Agrawal, and Amr El Abbadi. 2011. Limiting the spread of misinformation in social networks. In Proceedings of the 20th international conference on World Wide Web. ACM, 665--674. Google ScholarDigital Library
- Damon Centola. 2010. The spread of behavior in an online social network experiment. science, Vol. 329, 5996 (2010), 1194--1197.Google Scholar
- Chen Chen, Hanghang Tong, B Aditya Prakash, Charalampos E Tsourakakis, Tina Eliassi-Rad, Christos Faloutsos, and Duen Horng Chau. 2016. Node Immunization on Large Graphs: Theory and Algorithms. IEEE Transactions on Knowledge and Data Engineering, Vol. 28, 1 (2016), 113--126. Google ScholarDigital Library
- Wei Chen, Chi Wang, and Yajun Wang. 2010. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In KDD. ACM, 1029--1038. Google ScholarDigital Library
- Daryl J Daley and David G Kendall. 1964. Epidemics and rumours. (1964).Google Scholar
- Michela Del Vicario, Alessandro Bessi, Fabiana Zollo, Fabio Petroni, Antonio Scala, Guido Caldarelli, H Eugene Stanley, and Walter Quattrociocchi. 2016. The spreading of misinformation online. Proceedings of the National Academy of Sciences(PNAS), Vol. 113, 3 (2016), 554--559.Google ScholarCross Ref
- Uriel Feige. 1998. A threshold of ln n for approximating set cover. Journal of the ACM (JACM), Vol. 45, 4 (1998), 634--652. Google ScholarDigital Library
- Miroslav Fiedler. 1973. Algebraic connectivity of graphs. Czechoslovak mathematical journal, Vol. 23, 2 (1973), 298--305.Google Scholar
- Amit Goyal, Wei Lu, and Laks VS Lakshmanan. 2011. Simpath: An efficient algorithm for influence maximization under the linear threshold model. In Data Mining (ICDM), 2011 IEEE 11th International Conference on. IEEE, 211--220. Google ScholarDigital Library
- Daniel Gruhl, Ramanathan Guha, David Liben-Nowell, and Andrew Tomkins. 2004. Information diffusion through blogspace. In Proceedings of the 13th international conference on World Wide Web. ACM, 491--501. Google ScholarDigital Library
- Xinran He, Guojie Song, Wei Chen, and Qingye Jiang. 2012. Influence Blocking Maximization in Social Networks under the Competitive Linear Threshold Model.. In SDM. SIAM, 463--474.Google Scholar
- Zaobo He, Zhipeng Cai, Jiguo Yu, Xiaoming Wang, Yunchuan Sun, and Yingshu Li. 2017. Cost-efficient strategies for restraining rumor spreading in mobile social networks. IEEE Transactions on Vehicular Technology, Vol. 66, 3 (2017), 2789--2800.Google ScholarCross Ref
- Andrew Hiles, This Chapter Covers, and How Rumors Spread. 2011. How Firms Should Fight Rumors. Reputation Management: Building and Protecting Your Company's Profile in a Digital World (2011), 1--44.Google Scholar
- Ken-ichi Kawarabayashi. 2014. Optimal budget allocation: Theoretical guarantee and efficient algorithm. (2014).Google Scholar
- David Kempe, Jon Kleinberg, and Éva Tardos. 2003. 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, 137--146. Google ScholarDigital Library
- William O Kermack and Anderson G McKendrick. 1927. A contribution to the mathematical theory of epidemics. In Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences, Vol. 115. 700--721.Google ScholarCross Ref
- Jan Kostka, Yvonne Anne Oswald, and Roger Wattenhofer. 2008. Rumor dissemination in social networks. In International Colloquium on Structural Information and Communication Complexity. Springer, 185--196. Google ScholarDigital Library
- Sangho Lee and Jong Kim. 2014. Early filtering of ephemeral malicious accounts on Twitter. Computer Communications, Vol. 54 (2014), 48--57. Google ScholarDigital Library
- Jure Leskovec and Rok Sosivc. 2016. SNAP: A General-Purpose Network Analysis and Graph-Mining Library. ACM Transactions on Intelligent Systems and Technology (TIST), Vol. 8, 1 (2016), 1. Google ScholarDigital Library
- Chaz Lever, Platon Kotzias, Davide Balzarotti, Juan Caballero, and Manos Antonakakis. 2017. A Lustrum of malware network communication: Evolution and insights. In Security and Privacy (SP), 2017 IEEE Symposium on. IEEE, 788--804.Google ScholarCross Ref
- Hui Li, Sourav S Bhowmick, Jiangtao Cui, Yunjun Gao, and Jianfeng Ma. 2015. Getreal: Towards realistic selection of influence maximization strategies in competitive networks. In ACM SIGMOD International Conference on Management of Data. ACM, 1525--1537. Google ScholarDigital Library
- Iouliana Litou, Vana Kalogeraki, Ioannis Katakis, and Dimitrios Gunopulos. 2016. Real-Time and Cost-Effective Limitation of Misinformation Propagation. (2016).Google Scholar
- Wei Lu, Francesco Bonchi, Amit Goyal, and Laks VS Lakshmanan. 2013. The bang for the buck: fair competitive viral marketing from the host perspective. In International Conference on Knowledge Discovery and Data Dining (KDD). ACM, 928--936. Google ScholarDigital Library
- Carsten Lund and Mihalis Yannakakis. 1994. On the hardness of approximating minimization problems. Journal of the ACM (JACM), Vol. 41, 5 (1994), 960--981. Google ScholarDigital Library
- Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, Amin Karbasi, Jan Vondrák, and Andreas Krause. 2014. Lazier Than Lazy Greedy. arXiv preprint arXiv:1409.7938 (2014). Google ScholarDigital Library
- Yamir Moreno, Maziar Nekovee, and Amalio F Pacheco. 2004. Dynamics of rumor spreading in complex networks. Physical Review E, Vol. 69, 6 (2004), 066130.Google ScholarCross Ref
- Fred Morstatter, Liang Wu, Tahora H Nazer, Kathleen M Carley, and Huan Liu. 2016. A new approach to bot detection: striking the balance between precision and recall. In 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM). IEEE, 533--540. Google ScholarDigital Library
- Mark EJ Newman. 2001. The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences (PNAS), Vol. 98, 2 (2001), 404--409.Google ScholarCross Ref
- Nam P Nguyen, Guanhua Yan, My T Thai, and Stephan Eidenbenz. 2012. Containment of misinformation spread in online social networks. In Proceedings of the 4th Annual ACM Web Science Conference. ACM, 213--222. Google ScholarDigital Library
- Shirin Nilizadeh, Francc ois Labrèche, Alireza Sedighian, Ali Zand, José Fernandez, Christopher Kruegel, Gianluca Stringhini, and Giovanni Vigna. 2017. POISED: Spotting Twitter Spam Off the Beaten Paths. arXiv preprint arXiv:1708.09058 (2017).Google Scholar
- Michael Simpson, Venkatesh Srinivasan, and Alex Thomo. 2016. Clearing contamination in large networks. IEEE Transactions on Knowledge and Data Engineering, Vol. 28, 6 (2016), 1435--1448. Google ScholarDigital Library
- Chonggang Song, Wynne Hsu, and Mong Li Lee. 2015. Node Immunization over Infectious Period. In Proceedings of the 24th ACM International on Conference on Information and Knowledge Management. ACM, 831--840. Google ScholarDigital Library
- Hanghang Tong, B Aditya Prakash, Charalampos Tsourakakis, Tina Eliassi-Rad, Christos Faloutsos, and Duen Horng Chau. 2010. On the vulnerability of large graphs. In International Conference on Data Mining. IEEE, 1091--1096. Google ScholarDigital Library
- Steve Webb, James Caverlee, and Calton Pu. 2008. Social Honeypots: Making Friends With A Spammer Near You.. In CEAS.Google Scholar
- Laurence A Wolsey. 1982. An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica, Vol. 2, 4 (1982), 385--393.Google ScholarCross Ref
- Liang Wu, Xia Hu, Fred Morstatter, and Huan Liu. 2017a. Adaptive spammer detection with sparse group modeling. In Eleventh International AAAI Conference on Web and Social Media.Google Scholar
- Liang Wu, Xia Hu, Fred Morstatter, and Huan Liu. 2017b. Detecting camouflaged content polluters. In Eleventh International AAAI Conference on Web and Social Media.Google Scholar
- Liang Wu, Jundong Li, Xia Hu, and Huan Liu. 2017c. Gleaning wisdom from the past: Early detection of emerging rumors in social media. In Proceedings of the 2017 SIAM International Conference on Data Mining. SIAM, 99--107.Google ScholarCross Ref
- Liang Wu and Huan Liu. 2018. Tracing fake-news footprints: Characterizing social media messages by how they propagate. In Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining. ACM, 637--645. Google ScholarDigital Library
- Liang Wu, Fred Morstatter, Xia Hu, and Huan Liu. 2016. Mining misinformation in social media. Big Data in Complex and Social Networks (2016), 123--152.Google Scholar
- Reza Zafarani and Huan Liu. 10 Bits of Surprise: Detecting Malicious Users with Minimum Information (CIKM'15). ACM. Google ScholarDigital Library
- Yao Zhang, Sudip Saha, Anil Vullikanti, B Aditya Prakash, and others. 2015. Near-optimal Algorithms for Controlling Propagation at Group Scale on Networks. IEEE Transactions on Knowledge and Data Engineering (2015). Google ScholarDigital Library
Index Terms
- Debunking Rumors in Social Networks: A Timely Approach
Recommendations
Tracing Fake-News Footprints: Characterizing Social Media Messages by How They Propagate
WSDM '18: Proceedings of the Eleventh ACM International Conference on Web Search and Data MiningWhen a message, such as a piece of news, spreads in social networks, how can we classify it into categories of interests, such as genuine or fake news? Classification of social media content is a fundamental task for social media mining, and most ...
Towards combating rumors in social networks: Models and metrics
Dynamic Networks and Knowledge DiscoveryRumor is a potentially harmful social phenomenon that has been observed in all human societies in all times. Social networking sites provide a platform for the rapid interchange of information and hence, for the rapid dissemination of unsubstantiated ...
Analyzing topological characteristics of the Korean blogosphere
Due to their popularity and widespread use, blogs have become an important medium through which many people communicate and exchange information on the World Wide Web (WWW). The blogosphere has provided many opportunities for individuals and companies ...
Comments