Modeling User Behavior With Interaction Networks for Spam Detection
- URL: http://arxiv.org/abs/2207.10767v1
- Date: Thu, 21 Jul 2022 21:34:56 GMT
- Title: Modeling User Behavior With Interaction Networks for Spam Detection
- Authors: Prabhat Agarwal, Manisha Srivastava, Vishwakarma Singh, Charles
Rosenberg
- Abstract summary: Spam is a serious problem plaguing web-scale digital platforms.
We propose SEINE, a spam detection model over a novel graph framework.
Our model considers neighborhood along with edge types and attributes, allowing it to capture a wide range of spammers.
- Score: 4.795582035438343
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Spam is a serious problem plaguing web-scale digital platforms which
facilitate user content creation and distribution. It compromises platform's
integrity, performance of services like recommendation and search, and overall
business. Spammers engage in a variety of abusive and evasive behavior which
are distinct from non-spammers. Users' complex behavior can be well represented
by a heterogeneous graph rich with node and edge attributes. Learning to
identify spammers in such a graph for a web-scale platform is challenging
because of its structural complexity and size. In this paper, we propose SEINE
(Spam DEtection using Interaction NEtworks), a spam detection model over a
novel graph framework. Our graph simultaneously captures rich users' details
and behavior and enables learning on a billion-scale graph. Our model considers
neighborhood along with edge types and attributes, allowing it to capture a
wide range of spammers. SEINE, trained on a real dataset of tens of millions of
nodes and billions of edges, achieves a high performance of 80% recall with 1%
false positive rate. SEINE achieves comparable performance to the
state-of-the-art techniques on a public dataset while being pragmatic to be
used in a large-scale production system.
Related papers
- Synergistic Signals: Exploiting Co-Engagement and Semantic Links via
Graph Neural Networks [4.261438296177923]
We study the problem in the context recommender systems at Netflix.
We propose a novel graph-based approach called SemanticGNN.
Our key technical contributions are twofold: (1) we develop a novel relation-aware attention graph neural network (GNN) to handle the imbalanced distribution of relation types in our graph; (2) to handle web-scale graph data that has millions of nodes and billions of edges, we develop a novel distributed graph training paradigm.
arXiv Detail & Related papers (2023-12-07T06:29:26Z) - Instant Representation Learning for Recommendation over Large Dynamic
Graphs [29.41179019520622]
We propose SUPA, a novel graph neural network for dynamic multiplex heterogeneous graphs.
For each new edge, SUPA samples an influenced subgraph, updates the representations of the two interactive nodes, and propagates the interaction information to the sampled subgraph.
To train SUPA incrementally online, we propose InsLearn, an efficient workflow for single-pass training of large dynamic graphs.
arXiv Detail & Related papers (2023-05-22T15:36:10Z) - Audience Expansion for Multi-show Release Based on an Edge-prompted
Heterogeneous Graph Network [5.8720142291102135]
We propose a two-stage audience expansion scheme based on an edge-prompted heterogeneous graph network.
In the offline stage, to construct the graph, user IDs and specific side information combinations of the shows are chosen to be the nodes.
In the online stage, posterior data including click/view users are employed as seeds to look for similar users.
arXiv Detail & Related papers (2023-04-08T15:14:32Z) - Learnable Graph Matching: A Practical Paradigm for Data Association [74.28753343714858]
We propose a general learnable graph matching method to address these issues.
Our method achieves state-of-the-art performance on several MOT datasets.
For image matching, our method outperforms state-of-the-art methods on a popular indoor dataset, ScanNet.
arXiv Detail & Related papers (2023-03-27T17:39:00Z) - Model Inversion Attacks against Graph Neural Networks [65.35955643325038]
We study model inversion attacks against Graph Neural Networks (GNNs)
In this paper, we present GraphMI to infer the private training graph data.
Our experimental results show that such defenses are not sufficiently effective and call for more advanced defenses against privacy attacks.
arXiv Detail & Related papers (2022-09-16T09:13:43Z) - A Robust Stacking Framework for Training Deep Graph Models with
Multifaceted Node Features [61.92791503017341]
Graph Neural Networks (GNNs) with numerical node features and graph structure as inputs have demonstrated superior performance on various supervised learning tasks with graph data.
The best models for such data types in most standard supervised learning settings with IID (non-graph) data are not easily incorporated into a GNN.
Here we propose a robust stacking framework that fuses graph-aware propagation with arbitrary models intended for IID data.
arXiv Detail & Related papers (2022-06-16T22:46:33Z) - 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) - GraphMI: Extracting Private Graph Data from Graph Neural Networks [59.05178231559796]
We present textbfGraph textbfModel textbfInversion attack (GraphMI), which aims to extract private graph data of the training graph by inverting GNN.
Specifically, we propose a projected gradient module to tackle the discreteness of graph edges while preserving the sparsity and smoothness of graph features.
We design a graph auto-encoder module to efficiently exploit graph topology, node attributes, and target model parameters for edge inference.
arXiv Detail & Related papers (2021-06-05T07:07:52Z) - SIGN: Scalable Inception Graph Neural Networks [4.5158585619109495]
We propose a new, efficient and scalable graph deep learning architecture that sidesteps the need for graph sampling.
Our architecture allows using different local graph operators to best suit the task at hand.
We obtain state-of-the-art results on ogbn-papers100M, the largest public graph dataset, with over 110 million nodes and 1.5 billion edges.
arXiv Detail & Related papers (2020-04-23T14:46:10Z) - 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.