Friend or Faux: Graph-Based Early Detection of Fake Accounts on Social Networks

• URL: http://arxiv.org/abs/2004.04834v1
• Date: Thu, 9 Apr 2020 22:03:28 GMT
• Title: Friend or Faux: Graph-Based Early Detection of Fake Accounts on Social Networks
• Authors: Adam Breuer, Roee Eilat, and Udi Weinsberg
• Abstract summary: We present the SybilEdge algorithm, which determines whether a new user is a fake account by aggregating over (I) her choices of friend request targets and (II) these targets' respective responses. We show that SybilEdge rapidly detects new fake users at scale on the Facebook network and outperforms state-of-the-art algorithms.
• Score: 4.923937591056569
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, we study the problem of early detection of fake user accounts on social networks based solely on their network connectivity with other users. Removing such accounts is a core task for maintaining the integrity of social networks, and early detection helps to reduce the harm that such accounts inflict. However, new fake accounts are notoriously difficult to detect via graph-based algorithms, as their small number of connections are unlikely to reflect a significant structural difference from those of new real accounts. We present the SybilEdge algorithm, which determines whether a new user is a fake account (`sybil') by aggregating over (I) her choices of friend request targets and (II) these targets' respective responses. SybilEdge performs this aggregation giving more weight to a user's choices of targets to the extent that these targets are preferred by other fakes versus real users, and also to the extent that these targets respond differently to fakes versus real users. We show that SybilEdge rapidly detects new fake users at scale on the Facebook network and outperforms state-of-the-art algorithms. We also show that SybilEdge is robust to label noise in the training data, to different prevalences of fake accounts in the network, and to several different ways fakes can select targets for their friend requests. To our knowledge, this is the first time a graph-based algorithm has been shown to achieve high performance (AUC>0.9) on new users who have only sent a small number of friend requests.

Related papers

• Unsupervised detection of coordinated fake-follower campaigns on social media [1.3035246321276739]
  We present a novel unsupervised detection method designed to target a specific category of malicious accounts. Our framework identifies anomalous following patterns among all the followers of a social media account. We find that these detected groups of anomalous followers exhibit consistent behavior across multiple accounts.
  arXiv  Detail & Related papers  (2023-10-31T12:30:29Z)
• Online Corrupted User Detection and Regret Minimization [49.536254494829436]
  In real-world online web systems, multiple users usually arrive sequentially into the system. We present an important online learning problem named LOCUD to learn and utilize unknown user relations from disrupted behaviors. We devise a novel online detection algorithm OCCUD based on RCLUB-WCU's inferred user relations.
  arXiv  Detail & Related papers  (2023-10-07T10:20:26Z)
• Preemptive Detection of Fake Accounts on Social Networks via Multi-Class Preferential Attachment Classifiers [2.580765958706854]
  We describe a new algorithm called PreAttacK for detecting fake accounts in a social network. We show that PreAttacK approximates the posterior probability that a new account is fake under a multi-class Preferential Attachment model. These are the first provable guarantees for fake account detection that apply to new users.
  arXiv  Detail & Related papers  (2023-08-10T05:49:30Z)
• Transaction Fraud Detection via an Adaptive Graph Neural Network [64.9428588496749]
  We propose an Adaptive Sampling and Aggregation-based Graph Neural Network (ASA-GNN) that learns discriminative representations to improve the performance of transaction fraud detection. A neighbor sampling strategy is performed to filter noisy nodes and supplement information for fraudulent nodes. Experiments on three real financial datasets demonstrate that the proposed method ASA-GNN outperforms state-of-the-art ones.
  arXiv  Detail & Related papers  (2023-07-11T07:48:39Z)
• Fraudulent User Detection Via Behavior Information Aggregation Network (BIAN) On Large-Scale Financial Social Network [8.687460943376605]
  We propose a novel behavior information aggregation network (BIAN) to combine the user behaviors with other user features. The experimental results on a real-world large-scale financial social network dataset, DGraph, show that BIAN obtains the 10.2% gain in AUROC.
  arXiv  Detail & Related papers  (2022-11-04T08:33:06Z)
• Detecting fake accounts through Generative Adversarial Network in online social media [0.0]
  This paper proposes a novel method using user similarity measures and the Generative Adversarial Network (GAN) algorithm to identify fake user accounts in the Twitter dataset. Despite the problem's complexity, the method achieves an AUC rate of 80% in classifying and detecting fake accounts.
  arXiv  Detail & Related papers  (2022-10-25T10:20:27Z)
• Compromised account detection using authorship verification: a novel approach [1.0312968200748118]
  Compromising legitimate accounts is a way of disseminating malicious content to a large user base in Online Social Networks (OSNs) This paper proposes a novel approach based on authorship verification to identify compromised twitter accounts.
  arXiv  Detail & Related papers  (2022-06-02T14:54:27Z)
• Identification of Twitter Bots based on an Explainable ML Framework: the US 2020 Elections Case Study [72.61531092316092]
  This paper focuses on the design of a novel system for identifying Twitter bots based on labeled Twitter data. Supervised machine learning (ML) framework is adopted using an Extreme Gradient Boosting (XGBoost) algorithm. Our study also deploys Shapley Additive Explanations (SHAP) for explaining the ML model predictions.
  arXiv  Detail & Related papers  (2021-12-08T14:12:24Z)
• Relational Graph Neural Networks for Fraud Detection in a Super-App environment [53.561797148529664]
  We propose a framework of relational graph convolutional networks methods for fraudulent behaviour prevention in the financial services of a Super-App. We use an interpretability algorithm for graph neural networks to determine the most important relations to the classification task of the users. Our results show that there is an added value when considering models that take advantage of the alternative data of the Super-App and the interactions found in their high connectivity.
  arXiv  Detail & Related papers  (2021-07-29T00:02:06Z)
• Enabling certification of verification-agnostic networks via memory-efficient semidefinite programming [97.40955121478716]
  We propose a first-order dual SDP algorithm that requires memory only linear in the total number of network activations. We significantly improve L-inf verified robust accuracy from 1% to 88% and 6% to 40% respectively. We also demonstrate tight verification of a quadratic stability specification for the decoder of a variational autoencoder.
  arXiv  Detail & Related papers  (2020-10-22T12:32:29Z)
• Leveraging Multi-Source Weak Social Supervision for Early Detection of Fake News [67.53424807783414]
  Social media has greatly enabled people to participate in online activities at an unprecedented rate. This unrestricted access also exacerbates the spread of misinformation and fake news online which might cause confusion and chaos unless being detected early for its mitigation. We jointly leverage the limited amount of clean data along with weak signals from social engagements to train deep neural networks in a meta-learning framework to estimate the quality of different weak instances. Experiments on realworld datasets demonstrate that the proposed framework outperforms state-of-the-art baselines for early detection of fake news without using any user engagements at prediction time.
  arXiv  Detail & Related papers  (2020-04-03T18:26:33Z)

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.