Minimizing the influence of dynamic rumors based on community structure (Englisch)

Freier Zugriff
in International Journal of Crowd Science ; 3 , 3 ; 303-314
International Journal of Crowd Science

With the rapid development of internet technology, open online social networks provide a broader platform for information spreading. While dissemination of information provides convenience for life, it also brings many problems such as security risks and public opinion orientation. Various negative, malicious and false information spread across regions, which seriously affect social harmony and national security. Therefore, this paper aims to minimize negative information such as online rumors that has attracted extensive attention. The most existing algorithms for blocking rumors have prevented the spread of rumors to some extent, but these algorithms are designed based on entire social networks, mainly focusing on the microstructure of the network, i.e. the pairwise relationship or similarity between nodes. The blocking effect of these algorithms may be unsatisfactory in some networks because of the sparse data in the microstructure.

Design/methodology/approach

An algorithm for minimizing the influence of dynamic rumor based on community structure is proposed in this paper. The algorithm first divides the network into communities, and integrates the influence of each node within communities and rumor influence probability to measure the influence of each node in the entire network, and then selects key nodes and bridge nodes in communities as blocked nodes. After that, a dynamic blocking strategy is adopted to improve the blocking effect of rumors.

Findings

Community structure is one of the most prominent features of networks. It reveals the organizational structure and functional components of a network from a mesoscopic level. The utilization of community structure can provide effective and rich information to solve the problem of data sparsity in the microstructure, thus effectively improve the blocking effect. Extensive experiments on two real-world data sets have validated that the proposed algorithm has superior performance than the baseline algorithms.

Originality/value

As an important research direction of social network analysis, rumor minimization has a profound effect on the harmony and stability of society and the development of social media. However, because the rumor spread has the characteristics of multiple propagation paths, fast propagation speed, wide propagation area and time-varying, it is a huge challenge to improve the effectiveness of the rumor blocking algorithm.

Wie erhalte ich diesen Titel?

Dokumentinformationen


Inhaltsverzeichnis – Band 3, Ausgabe 3

Zeige alle Jahrgänge und Ausgaben

Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Nachweisen der enthaltenen Aufsätze. Die Anzeige der Jahrgänge kann aufgrund fehlender Aufsatznachweise unvollständig oder lückenhaft sein, obwohl die Zeitschrift komplett in der TIB verfügbar ist.

222
Quality assessment in crowdsourced classification tasks
Bu, Qiong / Simperl, Elena / Chapman, Adriane / Maddalena, Eddy | 2019
249
Intelligence level analysis for crowd networks based on business entropy
Li, Zhouxia / Pan, Zhiwen / Wang, Xiaoni / Ji, Wen / Yang, Feng | 2019
267
Transaction credit in the unstructured crowd transaction network
Liu, Zhishuo / Fang, Tian / Dongxin, Yao / Kou, Nianci | 2019
284
Adaptive information sharing approach for crowd networks based on two stage optimization
Wang, Xiaoni / Pan, Zhiwen / Li, Zhouxia / Ji, Wen / Yang, Feng | 2019
303
Minimizing the influence of dynamic rumors based on community structure
Wu, Qingqing / Zhao, Xianguan / Zhou, Lihua / Wang, Yao / Yang, Yudi | 2019
315
Knowledge discovery in sociological databases
Pan, Zhiwen / Li, Jiangtian / Chen, Yiqiang / Pacheco, Jesus / Dai, Lianjun / Zhang, Jun | 2019
333
An anomaly detection method to improve the intelligent level of smart articles based on multiple group correlation probability models
Lu, Xudong / Wang, Shipeng / Kang, Fengjian / Liu, Shijun / Li, Hui / Xu, Xiangzhen / Cui, Lizhen | 2019
348
Expert recommendation in community question answering: a review and future direction
Yang, Zhengfa / Liu, Qian / Sun, Baowen / Zhao, Xin | 2019

Ähnliche Titel