User-Device Authentication in Mobile Banking using APHEN for Paratuck2 Tensor Decomposition

05/23/2019
by   Jeremy Charlier, et al.
0

The new financial European regulations such as PSD2 are changing the retail banking services. Noticeably, the monitoring of the personal expenses is now opened to other institutions than retail banks. Nonetheless, the retail banks are looking to leverage the user-device authentication on the mobile banking applications to enhance the personal financial advertisement. To address the profiling of the authentication, we rely on tensor decomposition, a higher dimensional analogue of matrix decomposition. We use Paratuck2, which expresses a tensor as a multiplication of matrices and diagonal tensors, because of the imbalance between the number of users and devices. We highlight why Paratuck2 is more appropriate in this case than the popular CP tensor decomposition, which decomposes a tensor as a sum of rank-one tensors. However, the computation of Paratuck2 is computational intensive. We propose a new APproximate HEssian-based Newton resolution algorithm, APHEN, capable of solving Paratuck2 more accurately and faster than the other popular approaches based on alternating least square or gradient descent. The results of Paratuck2 are used for the predictions of users' authentication with neural networks. We apply our method for the concrete case of targeting clients for financial advertising campaigns based on the authentication events generated by mobile banking applications.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/23/2023

Finding tensor decompositions with sparse optimization

In this paper, we suggest a new method for a given tensor to find CP dec...
research
04/12/2021

Characterization of Decomposition of Matrix Multiplication Tensors

In this paper, the canonical polyadic (CP) decomposition of tensors that...
research
10/08/2020

Orthogonal Decomposition of Tensor Trains

In this paper we study the problem of recovering a tensor network decomp...
research
10/27/2019

Comparison of Accuracy and Scalability of Gauss-Newton and Alternating Least Squares for CP Decomposition

Alternating least squares is the most widely used algorithm for CP tenso...
research
10/11/2022

Distributed-Memory Randomized Algorithms for Sparse Tensor CP Decomposition

Low-rank Candecomp / PARAFAC (CP) Decomposition is a powerful tool for t...
research
02/09/2022

A Coupled CP Decomposition for Principal Components Analysis of Symmetric Networks

In a number of application domains, one observes a sequence of network d...
research
08/28/2018

Analysis and Improvement of a Lightweight Anonymous Authentication Protocol for Mobile Pay-TV Systems (Full text)

For many years, the pay-TV system has attracted a lot of users. Users ha...

Please sign up or login with your details

Forgot password? Click here to reset