Graph Regularized Nonnegative Latent Factor Analysis Model for Temporal Link Prediction in Cryptocurrency Transaction Networks

TL;DR

This paper introduces a novel graph regularized nonnegative latent factor analysis model for temporal link prediction in cryptocurrency transaction networks, addressing the dynamics neglected in prior studies.

Contribution

It proposes the SLF-NMGRU algorithm and GrNLFA model, integrating graph regularization with nonnegative latent factors for improved prediction accuracy and efficiency.

Findings

Enhanced link prediction accuracy on real cryptocurrency data

Improved computational efficiency over existing methods

Effectiveness demonstrated through experiments on real networks

Abstract

With the development of blockchain technology, the cryptocurrency based on blockchain technology is becoming more and more popular. This gave birth to a huge cryptocurrency transaction network has received widespread attention. Link prediction learning structure of network is helpful to understand the mechanism of network, so it is also widely studied in cryptocurrency network. However, the dynamics of cryptocurrency transaction networks have been neglected in the past researches. We use graph regularized method to link past transaction records with future transactions. Based on this, we propose a single latent factor-dependent, non-negative, multiplicative and graph regularized-incorporated update (SLF-NMGRU) algorithm and further propose graph regularized nonnegative latent factor analysis (GrNLFA) model. Finally, experiments on a real cryptocurrency transaction network show that the proposed method improves both the accuracy and the computational efficiency