Fake News Identification using Machine Learning Algorithms Based on Graph Features

• URL: http://arxiv.org/abs/2208.10641v1
• Date: Mon, 22 Aug 2022 22:42:57 GMT
• Title: Fake News Identification using Machine Learning Algorithms Based on Graph Features
• Authors: Yuxuan Tian
• Abstract summary: This study aims to build a model for identifying fake news using graphs and machine learning algorithms. It can effectively predict fake news, prevent potential negative social impact caused by fake news, and provide a new perspective on graph feature selection for machine learning models.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The spread of fake news has long been a social issue and the necessity of identifying it has become evident since its dangers are well recognized. In addition to causing uneasiness among the public, it has even more devastating consequences. For instance, it might lead to death during pandemics due to unverified medical instructions. This study aims to build a model for identifying fake news using graphs and machine learning algorithms. Instead of scanning the news content or user information, the research explicitly focuses on the spreading network, which shows the interconnection among people, and graph features such as the Eigenvector centrality, Jaccard Coefficient, and the shortest path. Fourteen features are extracted from graphs and tested in thirteen machine learning models. After analyzing these features and comparing the test result of machine learning models, the results reflect that propensity and centrality contribute highly to the classification. The best performing models reach 0.9913 and 0.9987 separately from datasets Twitter15 and Twitter16 using a modified tree classifier and Support Vector Classifier. This model can effectively predict fake news, prevent potential negative social impact caused by fake news, and provide a new perspective on graph feature selection for machine learning models.

Related papers

• A Survey of Deep Graph Learning under Distribution Shifts: from Graph Out-of-Distribution Generalization to Adaptation [59.14165404728197]
  We provide an up-to-date and forward-looking review of deep graph learning under distribution shifts. Specifically, we cover three primary scenarios: graph OOD generalization, training-time graph OOD adaptation, and test-time graph OOD adaptation. To provide a better understanding of the literature, we systematically categorize the existing models based on our proposed taxonomy.
  arXiv  Detail & Related papers  (2024-10-25T02:39:56Z)
• LOSS-GAT: Label Propagation and One-Class Semi-Supervised Graph Attention Network for Fake News Detection [2.6396287656676725]
  Loss-GAT is a semi-supervised and one-class approach for fake news detection. We employ a two-step label propagation algorithm to categorize news into two groups: interest (fake) and non-interest (real)
  arXiv  Detail & Related papers  (2024-02-13T12:02:37Z)
• GAMC: An Unsupervised Method for Fake News Detection using Graph Autoencoder with Masking [18.783663535152158]
  Graph-based techniques have incorporated this social context but are limited by the need for large labeled datasets. This paper introduces GAMC, an unsupervised fake news detection technique using the Graph Autoencoder with Masking and Contrastive learning. By leveraging both the context and content of news propagation as self-supervised signals, our method negates the requirement for labeled datasets.
  arXiv  Detail & Related papers  (2023-12-10T03:34:29Z)
• State of the Art and Potentialities of Graph-level Learning [54.68482109186052]
  Graph-level learning has been applied to many tasks including comparison, regression, classification, and more. Traditional approaches to learning a set of graphs rely on hand-crafted features, such as substructures. Deep learning has helped graph-level learning adapt to the growing scale of graphs by extracting features automatically and encoding graphs into low-dimensional representations.
  arXiv  Detail & Related papers  (2023-01-14T09:15:49Z)
• A Graph-Enhanced Click Model for Web Search [67.27218481132185]
  We propose a novel graph-enhanced click model (GraphCM) for web search. We exploit both intra-session and inter-session information for the sparsity and cold-start problems.
  arXiv  Detail & Related papers  (2022-06-17T08:32:43Z)
• Graph Self-supervised Learning with Accurate Discrepancy Learning [64.69095775258164]
  We propose a framework that aims to learn the exact discrepancy between the original and the perturbed graphs, coined as Discrepancy-based Self-supervised LeArning (D-SLA) We validate our method on various graph-related downstream tasks, including molecular property prediction, protein function prediction, and link prediction tasks, on which our model largely outperforms relevant baselines.
  arXiv  Detail & Related papers  (2022-02-07T08:04:59Z)
• Development of Fake News Model using Machine Learning through Natural Language Processing [0.7120858995754653]
  We use machine learning algorithms and for identification of fake news. Simple classification is not completely correct in fake news detection. With the integration of machine learning and text-based processing, we can detect fake news.
  arXiv  Detail & Related papers  (2022-01-19T09:26:15Z)
• Intrusion Detection: Machine Learning Baseline Calculations for Image Classification [0.0]
  Cyber security can be enhanced through application of machine learning. Most promising candidates for consideration are Light Machine, Random Forest Boost, and Extra Trees.
  arXiv  Detail & Related papers  (2021-11-03T17:49:38Z)
• Unbiased Graph Embedding with Biased Graph Observations [52.82841737832561]
  We propose a principled new way for obtaining unbiased representations by learning from an underlying bias-free graph. Based on this new perspective, we propose two complementary methods for uncovering such an underlying graph.
  arXiv  Detail & Related papers  (2021-10-26T18:44:37Z)
• Adversarial Active Learning based Heterogeneous Graph Neural Network for Fake News Detection [18.847254074201953]
  We propose a novel fake news detection framework, namely Adversarial Active Learning-based Heterogeneous Graph Neural Network (AA-HGNN) AA-HGNN utilizes an active learning framework to enhance learning performance, especially when facing the paucity of labeled data. Experiments with two real-world fake news datasets show that our model can outperform text-based models and other graph-based models.
  arXiv  Detail & Related papers  (2021-01-27T05:05:25Z)
• Adversarial Attack on Community Detection by Hiding Individuals [68.76889102470203]
  We focus on black-box attack and aim to hide targeted individuals from the detection of deep graph community detection models. We propose an iterative learning framework that takes turns to update two modules: one working as the constrained graph generator and the other as the surrogate community detection model.
  arXiv  Detail & Related papers  (2020-01-22T09:50:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.