Wasserstein Distance-based Spectral Clustering with Application to Transaction Data

03/05/2022
by   Yingqiu Zhu, et al.
0

With the rapid development of online payment platforms, it is now possible to record massive transaction data. The economic behaviors are embedded in the transaction data for merchants using these platforms. Therefore, clustering on transaction data significantly contributes to analyzing merchants' behavior patterns. This may help the platforms provide differentiated services or implement risk management strategies. However, traditional methods exploit transactions by generating low-dimensional features, leading to inevitable information loss. To fully use the transaction data, we utilize the empirical cumulative distribution of transaction amount to characterize merchants. Then, we adopt Wasserstein distance to measure the dissimilarity between any two merchants and propose the Wasserstein-distance-based spectral clustering (WSC) approach. Considering the sample imbalance in real datasets, we incorporate indices based on local outlier factors to improve the clustering performance. Furthermore, to ensure feasibility if the proposed method on large-scale datasets with limited computational resources, we propose a subsampling version of WSC. The associated theoretical properties are investigated to verify the efficiency of the proposed approach. The simulations and empirical study demonstrate that the proposed method outperforms feature-based methods in finding behavior patterns of merchants.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/30/2021

Divide-and-conquer based Large-Scale Spectral Clustering

Spectral clustering is one of the most popular clustering methods. Howev...
research
06/13/2020

SDCOR: Scalable Density-based Clustering for Local Outlier Detection in Massive-Scale Datasets

This paper presents a batch-wise density-based clustering approach for l...
research
10/16/2019

Multiclass spectral feature scaling method for dimensionality reduction

Irregular features disrupt the desired classification. In this paper, we...
research
04/28/2019

Robust subspace clustering by Cauchy loss function

Subspace clustering is a problem of exploring the low-dimensional subspa...
research
10/22/2019

Multiple Sample Clustering

The clustering algorithms that view each object data as a single sample ...
research
06/24/2020

Consistency of Anchor-based Spectral Clustering

Anchor-based techniques reduce the computational complexity of spectral ...
research
12/26/2019

A Time Attention based Fraud Transaction Detection Framework

With online payment platforms being ubiquitous and important, fraud tran...

Please sign up or login with your details

Forgot password? Click here to reset