Investigating Fake and Reliable News Sources Using Complex Networks Analysis

被引:3
|
作者
Mazzeo, Valeria [1 ]
Rapisarda, Andrea [1 ,2 ,3 ]
机构
[1] Univ Catania, Dept Phys & Astron Ettore Majorana, Catania, Italy
[2] Complex Sci Hub Vienna CSH, Vienna, Austria
[3] INFN Sez Catania, Catania, Italy
关键词
complex networks; fake news; disinformation; audience overlap; search engine optimization;
D O I
10.3389/fphy.2022.886544
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
The rise of disinformation in the last years has shed light on the presence of bad actors that produce and spread misleading content every day. Therefore, looking at the characteristics of these actors has become crucial for gaining better knowledge of the phenomenon of disinformation to fight it. This study seeks to understand how these actors, meant here as unreliable news websites, differ from reliable ones. With this aim, we investigated some well-known fake and reliable news sources and their relationships, using a network growth model based on the overlap of their audience. Then, we peered into the news sites' sub-networks and their structure, finding that unreliable news sources' sub-networks are overall disassortative and have a low-medium clustering coefficient, indicative of a higher fragmentation. The k-core decomposition allowed us to find the coreness value for each node in the network, identifying the most connectedness site communities and revealing the structural organization of the network, where the unreliable websites tend to populate the inner shells. By analyzing WHOIS information, it also emerged that unreliable websites generally have a newer registration date and shorter-term registrations compared to reliable websites. The results on the political leaning of the news sources show extremist news sources of any political leaning are generally mostly responsible for producing and spreading disinformation.
引用
收藏
页数:19
相关论文
共 50 条
  • [41] Detecting Fake News Spreaders in Social Networks using Inductive Representation Learning
    Rath, Bhavtosh
    Salecha, Aadesh
    Srivastava, Jaideep
    2020 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM), 2020, : 182 - 189
  • [42] Multimodality and fake News: investigating the visual meanings in Facebook posts containing inaccurate news
    Macedo, Litiane Barbosa
    Oliveira, Isabel de Souza
    De Lima, Lucas Melo
    ENTREPALAVRAS, 2021, 11 (03):
  • [43] Fighting the Fake: A Forensic Linguistic Analysis to Fake News Detection
    Rui Sousa-Silva
    International Journal for the Semiotics of Law - Revue internationale de Sémiotique juridique, 2022, 35 : 2409 - 2433
  • [44] Fighting the Fake: A Forensic Linguistic Analysis to Fake News Detection
    Sousa-Silva, Rui
    INTERNATIONAL JOURNAL FOR THE SEMIOTICS OF LAW-REVUE INTERNATIONALE DE SEMIOTIQUE JURIDIQUE, 2022, 35 (06): : 2409 - 2433
  • [45] A Reliable Weighting Scheme for the Aggregation of Crowd Intelligence to Detect Fake News
    Tchakounte, Franklin
    Faissal, Ahmadou
    Atemkeng, Marcellin
    Ntyam, Achille
    INFORMATION, 2020, 11 (06)
  • [46] The analysis of images in the era of fake news
    Marzal-Felici, Javier
    Casero-Ripolles, Andreu
    ADCOMUNICA-REVISTA CIENTIFICA DE ESTRATEGIAS TENDENCIAS E INNOVACION EN COMMUNICACION, 2021, (22): : 11 - 20
  • [47] A Review of Methodologies for Fake News Analysis
    Tajrian, Mehedi
    Rahman, Azizur
    Kabir, Muhammad Ashad
    Islam, Md. Rafiqul
    IEEE ACCESS, 2023, 11 : 73879 - 73893
  • [48] Sentiment Analysis for Fake News Detection
    Alonso, Miguel A.
    Vilares, David
    Gomez-Rodriguez, Carlos
    Vilares, Jesus
    ELECTRONICS, 2021, 10 (11)
  • [49] Analysis of Classifiers for Fake News Detection
    Agarwala, Vasu
    Sultanaa, H. Parveen
    Malhotra, Srijan
    Sarkar, Amitrajit
    2ND INTERNATIONAL CONFERENCE ON RECENT TRENDS IN ADVANCED COMPUTING ICRTAC -DISRUP - TIV INNOVATION , 2019, 2019, 165 : 377 - 383
  • [50] Tracing the fake news propagation path using social network analysis
    S. Sivasankari
    G. Vadivu
    Soft Computing, 2022, 26 : 12883 - 12891