首页/论文/1905.08040

arXiv 1905.080402019-05-03cs.SI

Graph distances for determining entities relationships: a topological approach to fraud detection

J. M. Calabuig, H. Falciani, A. Ferrer-Sapena, L. M. García-Raffi, E. A. Sánchez-Pérez

英文摘要：

Given a set $Ω$ and a proximity function $ϕ: Ω\times Ω\to \mathbb R^+$, we define a new metric for $Ω$ by considering a path distance in $Ω$, that is considered as a complete graph. We analyze the properties of such a distance, and several procedures for defining the initial proximity matrix $( ϕ(a,b) )_{(a,b) \in Ω\times Ω}.$ Our motivation has its roots in the current interest in finding effective algorithms for detecting and classifying relations among elements of a social network. For example, the analysis of a set of companies working for a given public administration or other figures in which automatic fraud detection systems are needed. Using this formalism, we state our main idea regarding fraud detection, that is founded in the fact that fraud can be detected because it produces a meaningful local change of density in the metric space defined in this way.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

An expert system for detecting automobile insurance fraud using social network analysis

Faculty of Computer and Information Science, University of Ljubljana（卢布尔雅那大学计算机与信息科学学院）

The article proposes an expert system for detection, and subsequent investigation, of groups of collaborating automobile insurance fraudsters. The system is described and examined in great detail, several technical difficulties in detecting fraud are also considered, for it to be applicable in practice. Opposed to many other approaches, the system uses networks for representation of data. Networks are the most natural representation of such a relational domain, allowing formulation and analysis of complex relations between entities. Fraudulent entities are found by employing a novel assessment…

2011-04-19cs.AIcs.SIphysics.soc-ph

No Place to Hide: Catching Fraudulent Entities in Tensors

Many approaches focus on detecting dense blocks in the tensor of multimodal data to prevent fraudulent entities (e.g., accounts, links) from retweet boosting, hashtag hijacking, link advertising, etc. However, no existing method is effective to find the dense block if it only possesses high density on a subset of all dimensions in tensors. In this paper, we novelly identify dense-block detection with dense-subgraph mining, by modeling a tensor into a weighted graph without any density information lost. Based on the weighted graph, which we call information sharing graph (ISG), we propose an al…

2019-02-23cs.CRcs.DScs.SI

xFraud: Explainable Fraud Transaction Detection

ETH Zurich（苏黎世联邦理工学院）；eBay China（亿贝中国）

At online retail platforms, it is crucial to actively detect the risks of transactions to improve customer experience and minimize financial loss. In this work, we propose xFraud, an explainable fraud transaction prediction framework which is mainly composed of a detector and an explainer. The xFraud detector can effectively and efficiently predict the legitimacy of incoming transactions. Specifically, it utilizes a heterogeneous graph neural network to learn expressive representations from the informative heterogeneously typed entities in the transaction logs. The explainer in xFraud can gene…

2022-05-25cs.AIcs.LGcs.SI

SliceNDice: Mining Suspicious Multi-attribute Entity Groups with Multi-view Graphs

Columbia University（哥伦比亚大学）；Snap Inc.（Snap公司）

Given the reach of web platforms, bad actors have considerable incentives to manipulate and defraud users at the expense of platform integrity. This has spurred research in numerous suspicious behavior detection tasks, including detection of sybil accounts, false information, and payment scams/fraud. In this paper, we draw the insight that many such initiatives can be tackled in a common framework by posing a detection task which seeks to find groups of entities which share too many properties with one another across multiple attributes (sybil accounts created at the same time and location, pr…

2020-05-16cs.IRcs.LGcs.SI

DeepTrax: Embedding Graphs of Financial Transactions

Capital One（第一资本金融公司）

Financial transactions can be considered edges in a heterogeneous graph between entities sending money and entities receiving money. For financial institutions, such a graph is likely large (with millions or billions of edges) while also sparsely connected. It becomes challenging to apply machine learning to such large and sparse graphs. Graph representation learning seeks to embed the nodes of a graph into a Euclidean vector space such that graph topological properties are preserved after the transformation. In this paper, we present a novel application of representation learning to bipartite…

2019-07-16cs.LGcs.SIstat.ML

Change Detection in Dynamic Attributed Networks

A network provides powerful means of representing complex relationships between entities by abstracting entities as vertices, and relationships as edges connecting vertices in a graph. Beyond the presence or absence of relationships, a network may contain additional information that can be attributed to the entities and their relationships. Attaching these additional attribute data to the corresponding vertices and edges yields an attributed graph. Moreover, in the majority of real-world applications, such as online social networks, financial networks and transactional networks, relationships …

2020-01-14cs.SIstat.AP

更多相关论文收起更多论文

A Tractable Approach to Finding Closest Truncated-commute-time Neighbors in Large Graphs

Recently there has been much interest in graph-based learning, with applications in collaborative filtering for recommender networks, link prediction for social networks and fraud detection. These networks can consist of millions of entities, and so it is very important to develop highly efficient techniques. We are especially interested in accelerating random walk approaches to compute some very interesting proximity measures of these kinds of graphs. These measures have been shown to do well empirically (Liben-Nowell & Kleinberg, 2003; Brand, 2005). We introduce a truncated variation on a we…

2012-06-20cs.DScs.SIphysics.soc-ph

Determining the Scale of Impact from Denial-of-Service Attacks in Real Time Using Twitter

University of Maryland, Baltimore County（马里兰大学巴尔的摩县分校）

Denial of Service (DoS) attacks are common in on-line and mobile services such as Twitter, Facebook and banking. As the scale and frequency of Distributed Denial of Service (DDoS) attacks increase, there is an urgent need for determining the impact of the attack. Two central challenges of the task are to get feedback from a large number of users and to get it in a timely manner. In this paper, we present a weakly-supervised model that does not need annotated data to measure the impact of DoS issues by applying Latent Dirichlet Allocation and symmetric Kullback-Leibler divergence on tweets. The…

2019-09-12cs.CLcs.IRcs.SI

面向社交事件检测的元路径采样学习

Learning To Sample the Meta-Paths for Social Event Detection

本文提出端到端学习采样框架LTS，自动搜索并采样异质信息网络中最具影响力的元路径，以提升社交事件检测性能。

2024-11-19cs.SI

Coordination Event Detection and Initiator Identification in Time Series Data

University of Illinois at Chicago（伊利诺伊大学芝加哥分校）；Max Planck Institute for Ornithology（马克斯·普朗克鸟类学研究所）；University of California, Davis（加州大学戴维斯分校）

Behavior initiation is a form of leadership and is an important aspect of social organization that affects the processes of group formation, dynamics, and decision-making in human societies and other social animal species. In this work, we formalize the "Coordination Initiator Inference Problem" and propose a simple yet powerful framework for extracting periods of coordinated activity and determining individuals who initiated this coordination, based solely on the activity of individuals within a group during those periods. The proposed approach, given arbitrary individual time series, automat…

2019-11-23cs.AIcs.MAcs.SI