Over-Sampling Strategy in Feature Space for Graphs based Class-imbalanced Bot Detection

• URL: http://arxiv.org/abs/2302.06900v2
• Date: Mon, 11 Sep 2023 00:29:12 GMT
• Title: Over-Sampling Strategy in Feature Space for Graphs based Class-imbalanced Bot Detection
• Authors: Shuhao Shi, Kai Qiao, Jie Yang, Baojie Song, Jian Chen and Bin Yan
• Abstract summary: A large number of bots in Online Social Networks (OSN) leads to undesirable social effects. We propose an over-sampling strategy for GNNs that generates samples for the minority class without edge synthesis. The framework is evaluated using three real-world bot detection benchmark datasets.
• Score: 10.882979272768502
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The presence of a large number of bots in Online Social Networks (OSN) leads to undesirable social effects. Graph neural networks (GNNs) are effective in detecting bots as they utilize user interactions. However, class-imbalanced issues can affect bot detection performance. To address this, we propose an over-sampling strategy for GNNs (OS-GNN) that generates samples for the minority class without edge synthesis. First, node features are mapped to a feature space through neighborhood aggregation. Then, we generate samples for the minority class in the feature space. Finally, the augmented features are used to train the classifiers. This framework is general and can be easily extended into different GNN architectures. The proposed framework is evaluated using three real-world bot detection benchmark datasets, and it consistently exhibits superiority over the baselines.

Related papers

• BSG4Bot: Efficient Bot Detection based on Biased Heterogeneous Subgraphs [6.99955702963268]
  The detection of malicious social bots has become a crucial task, as bots can be easily deployed and manipulated to spread disinformation. Most existing approaches utilize graph neural networks (GNNs)to capture both user profle and structural features. This paper proposes a method named BSG4Bot with an intuition that GNNs training on Biased SubGraphs can improve both performance and time/space efficiency in bot detection.
  arXiv  Detail & Related papers  (2024-10-07T15:52:51Z)
• LGB: Language Model and Graph Neural Network-Driven Social Bot Detection [43.92522451274129]
  Malicious social bots achieve their malicious purposes by spreading misinformation and inciting social public opinion. We propose a novel social bot detection framework LGB, which consists of two main components: language model (LM) and graph neural network (GNN) Experiments on two real-world datasets demonstrate that LGB consistently outperforms state-of-the-art baseline models by up to 10.95%.
  arXiv  Detail & Related papers  (2024-06-13T02:47:38Z)
• GNN-LoFI: a Novel Graph Neural Network through Localized Feature-based Histogram Intersection [51.608147732998994]
  Graph neural networks are increasingly becoming the framework of choice for graph-based machine learning. We propose a new graph neural network architecture that substitutes classical message passing with an analysis of the local distribution of node features.
  arXiv  Detail & Related papers  (2024-01-17T13:04:23Z)
• My Brother Helps Me: Node Injection Based Adversarial Attack on Social Bot Detection [69.99192868521564]
  Social platforms such as Twitter are under siege from a multitude of fraudulent users. Due to the structure of social networks, the majority of methods are based on the graph neural network(GNN), which is susceptible to attacks. We propose a node injection-based adversarial attack method designed to deceive bot detection models.
  arXiv  Detail & Related papers  (2023-10-11T03:09:48Z)
• Muti-scale Graph Neural Network with Signed-attention for Social Bot Detection: A Frequency Perspective [10.089319405788277]
  The presence of a large number of bots on social media has adverse effects. The graph neural network (GNN) can effectively leverage the social relationships between users and achieve excellent results in detecting bots. This paper proposes a Multi-scale with Signed-attention Graph Filter for social bot detection called MSGS.
  arXiv  Detail & Related papers  (2023-07-05T00:40:19Z)
• RF-GNN: Random Forest Boosted Graph Neural Network for Social Bot Detection [10.690802468726078]
  The presence of a large number of bots on social media leads to adverse effects. This paper proposes a Random Forest boosted Graph Neural Network for social bot detection, called RF-GNN.
  arXiv  Detail & Related papers  (2023-04-14T00:57:44Z)
• Exploiting Neighbor Effect: Conv-Agnostic GNNs Framework for Graphs with Heterophily [58.76759997223951]
  We propose a new metric based on von Neumann entropy to re-examine the heterophily problem of GNNs. We also propose a Conv-Agnostic GNN framework (CAGNNs) to enhance the performance of most GNNs on heterophily datasets.
  arXiv  Detail & Related papers  (2022-03-19T14:26:43Z)
• VQ-GNN: A Universal Framework to Scale up Graph Neural Networks using Vector Quantization [70.8567058758375]
  VQ-GNN is a universal framework to scale up any convolution-based GNNs using Vector Quantization (VQ) without compromising the performance. Our framework avoids the "neighbor explosion" problem of GNNs using quantized representations combined with a low-rank version of the graph convolution matrix.
  arXiv  Detail & Related papers  (2021-10-27T11:48:50Z)
• GraphSMOTE: Imbalanced Node Classification on Graphs with Graph Neural Networks [28.92347073786722]
  Graph neural networks (GNNs) have achieved state-of-the-art performance of node classification. We propose a novel framework, GraphSMOTE, in which an embedding space is constructed to encode the similarity among the nodes. New samples are synthesize in this space to assure genuineness.
  arXiv  Detail & Related papers  (2021-03-16T03:23:55Z)
• Combining Label Propagation and Simple Models Out-performs Graph Neural Networks [52.121819834353865]
  We show that for many standard transductive node classification benchmarks, we can exceed or match the performance of state-of-the-art GNNs. We call this overall procedure Correct and Smooth (C&S) Our approach exceeds or nearly matches the performance of state-of-the-art GNNs on a wide variety of benchmarks.
  arXiv  Detail & Related papers  (2020-10-27T02:10:52Z)
• Towards Deeper Graph Neural Networks with Differentiable Group Normalization [61.20639338417576]
  Graph neural networks (GNNs) learn the representation of a node by aggregating its neighbors. Over-smoothing is one of the key issues which limit the performance of GNNs as the number of layers increases. We introduce two over-smoothing metrics and a novel technique, i.e., differentiable group normalization (DGN)
  arXiv  Detail & Related papers  (2020-06-12T07:18:02Z)

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.