arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.07181cs.LGstat.ML

面向信用卡欺诈检测的稀疏变化高斯近似方法

Towards Credit-Fraud Detection via Sparsely Varying Gaussian Approximations

Indian Institute of Technology, Jodhpur(印度理工学院焦特布尔分校)

Harshit Sharma, Harsh K. Gandhi, Apoorv Jain

AI总结:

本文提出一种基于稀疏高斯近似与诱导点的贝叶斯分类方法,用于信用卡欺诈检测,在大型金融数据集上以RBF核和较多诱导点取得高准确率与低方差预测。

摘要:

欺诈活动对许多金融机构而言是一个代价高昂的问题,每年给企业造成数十亿美元的损失。其中,信用卡欺诈是更为常见的活动类型。在此背景下,信用卡欺诈检测的概念已沿着在预测系统中纳入不确定性的思路发展,以确保在这一关键任务中做出更好的判断。我们提出使用一种稀疏高斯分类方法来处理大规模数据集,并利用伪输入或诱导输入的概念。我们使用不同的核函数和不同数量的诱导数据点进行了实验,结果表明,在选用RBF核且诱导点数量较多时获得了最佳准确率。鉴于我们所采用方法的随机性,我们的方法能够处理大规模金融数据,并且在预测中获得了较低的方差和良好的测试准确率,这表明了模型的置信度和鲁棒性。通过采用贝叶斯学习技术并结合诱导点现象,我们成功获得了良好的准确率和高置信度分数。

英文摘要:

Fraudulent activities are an expensive problem for many financial institutions, costing billions of dollars to corporations annually. More commonly occurring activities in this regard are credit card frauds. In this context, the credit card fraud detection concept has been developed over the lines of incorporating the uncertainty in our prediction system to ensure better judgment in such a crucial task. We propose to use a sparse Gaussian classification method to work with the large data-set and use the concept of pseudo or inducing inputs. We perform the same with different sets of kernels and the different number of inducing data points to show the best accuracy was obtained with the selection of RBF kernel with a higher number of inducing points. Our approach was able to work over large financial data given the stochastic nature of our method employed and also good test accuracy with low variance over the prediction suggesting confidence and robustness in our model. Using the methodologies of Bayesian learning techniques with the incorporated inducing points phenomenon, are successfully able to obtain a healthy accuracy and a high confidence score.

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

↑