Ranking Influential Nodes of Fake News Spreading on Mobile Social Networks

Ranking Influential Nodes of Fake News Spreading on Mobile Social Networks

Yunfei Xing, Xiwei Wang, Feng-Kwei Wang, Yang Shi, Wu He, Haowu Chang
Copyright: © 2021 |Pages: 38
DOI: 10.4018/JGIM.20210701.oa5
Article PDF Download
Open access articles are freely available for download

Abstract

Online fake news can generate a negative impact on both users and society. Due to the concerns with spread of fake news and misinformation, assessing the network influence of online users has become an important issue. This study quantifies the influence of nodes by proposing an algorithm based on information entropy theory. Dynamic process of influence of nodes is characterized on mobile social networks (MSNs). Weibo (i.e., the Chinese version of microblogging) users are chosen to build the real network and quantified influence of them is analyzed according to the model proposed in this paper. MATLAB is employed to simulate and validate the model. Results show the comprehensive influence of nodes increases with the rise of two factors: the number of nodes connected to them and the frequency of their interaction. Indirect influence of nodes becomes stronger than direct influence when the network scope rises. This study can help relevant organizations effectively oversee the spread of online fake news on MSNs.
Article Preview
Top

1. Introduction

The rapid development of information technology has radically changed the way in which people communicate with each other. Mobile social networks (MSNs) play a crucial role in people’s daily communications, nowadays. A growing number of social network users with similar interests can converse and share information via their mobile devices (Ferreira et al., 2019; Su et al, 2018; Syn & Oh, 2015). According to the latest data from GSMA Intelligence, by the end of 2019, there were 5.19 billion unique mobile phone users in the world, up 100 million from the prior year.

Word-of-mouth communication is becoming much easier, and communication often goes viral in a short period, via simple clicks. However, fake news spread on social networks can be distinctively abrupt and extremely fast-spreading, which can adversely affect the normal social order (Chua & Banerjee, 2018). The term “online fake news” refers to “unconfirmed bits of information” in circulation (Zhao et al., 2016). When disasters or emergencies occur, online fake news can easily trigger public panic that could profoundly threaten social stability. People often share fake news in social groups in which the members are not necessarily familiar with each other. They forward fake news to other individuals or groups without verifying the credibility of the news. Research shows that fake news spreads “significantly farther, faster, deeper, and more broadly” than true news (Vosoughi, Roy, & Aral, 2018). Thus, there is an increasing interest in studying the spread of fake news on social networks (Xu et al., 2017).

Existing studies on fake news spreading largely focus on rumor identification, detection and prediction (Bondielli & Marcelloni, 2019; Xu et al., 2020; Yu et al., 2020; Zhang & Ghorbani, 2020). However, not many studies pay attention to the identification of influential users in the research area of fake news spreading. As fake news spreading is rapid and fluid, the identification and detection of fake news are generally conducted after fake news was spread to some extent. To reduce the spread of fake news on social network, one possible way is to identify those who play influential role in fake news spreading and educate them to check the credibility of news before disseminating news with others. If those influential people on the social network are able to change their behaviors to share or forward fake news, the severity of fake news spreading will be mitigated. To this end, we believe ranking the influence of users in the widespread of online fake news would be a useful technique to reduce future distribution of fake news.

News can reach an even greater number of people instantly (Gao et al., 2018) via MSNs, which usually consist of a huge number of users having something in common, such as careers, projects, common goals, or lifestyles. Influential nodes are those users with greater influence on social networks; their communications are more likely to infect others (Tulu et al., 2018). Given the existence of the internet’ s current dramatic progress, the ability to find the influential nodes on MSNs is becoming more and more critical.

In recent years, much attention has been given to identifying influential nodes on MSNs. A number of approaches and measures have been proposed from a variety of fields, including SNA (centrality analysis), clustering coefficient analysis, and eigenvector analysis (Chen et al., 2017; Wang et al., 2017; Wu et al., 2018). Degree centrality, betweenness centrality, and closeness centrality are the three basic measurements that are used to evaluate the influence of network nodes (Blaszczyk, 2018). The method of clustering coefficient analysis focuses on the network topological structure, the vertex’s local feature, and the connection of the set pair (Sisodia et al., 2016). The method of eigenvector analysis basically analyzes the importance of a network’s quality and the number of connections in the network.

A variety of evaluation models for ranking influential nodes have been proven to be efficient; however, an important question remains: which fundamental rules should the evaluation model follow? To answer this question, we present a novel model for evaluating the influence of individuals on social networks based on the theory of information entropy. The network influence of a node is a measurement of its uncertainty, which is the fundamental law of entropy. We construct a relationship graph to gain a basic understanding of the influence of nodes, and then we provide an innovative approach to ranking influential nodes to learn more about the spreading of fake news on MSNs. We present a model that measures the direct influence, indirect influence and comprehensive influence of nodes on MSNs in order to describe the complexity and the uncertainty of their influence.

Complete Article List

Search this Journal:
Reset
Volume 32: 1 Issue (2024)
Volume 31: 9 Issues (2023)
Volume 30: 12 Issues (2022)
Volume 29: 6 Issues (2021)
Volume 28: 4 Issues (2020)
Volume 27: 4 Issues (2019)
Volume 26: 4 Issues (2018)
Volume 25: 4 Issues (2017)
Volume 24: 4 Issues (2016)
Volume 23: 4 Issues (2015)
Volume 22: 4 Issues (2014)
Volume 21: 4 Issues (2013)
Volume 20: 4 Issues (2012)
Volume 19: 4 Issues (2011)
Volume 18: 4 Issues (2010)
Volume 17: 4 Issues (2009)
Volume 16: 4 Issues (2008)
Volume 15: 4 Issues (2007)
Volume 14: 4 Issues (2006)
Volume 13: 4 Issues (2005)
Volume 12: 4 Issues (2004)
Volume 11: 4 Issues (2003)
Volume 10: 4 Issues (2002)
Volume 9: 4 Issues (2001)
Volume 8: 4 Issues (2000)
Volume 7: 4 Issues (1999)
Volume 6: 4 Issues (1998)
Volume 5: 4 Issues (1997)
Volume 4: 4 Issues (1996)
Volume 3: 4 Issues (1995)
Volume 2: 4 Issues (1994)
Volume 1: 4 Issues (1993)
View Complete Journal Contents Listing