Autoregressive-incorporated Non-negative Latent Factorization of Tensors for Temporal Link Prediction in Cryptocurrency Transaction Network

Cryptocurrency transaction networks (CTNs) are frequently encountered in real-world applications. Due to practical constraints, it is generally not feasible to observe complete interactions among all nodes at every time slot, leading to numerous missing links in CTNs. A link prediction model based on Non-negative Latent Factorization of Tensors (NLFT) has demonstrated effectiveness in predicting these missing links within a temporal network. However, existing NLFT models do not adequately capture the evolving relationships within a temporal network, limiting their ability to predict temporal links effectively. To address this limitation, this paper proposes an Autoregressive-incorporated Non-negative Latent-Factorization of Tensors (ArNLFT) model. The core idea is to adopt an autoregressive model to represent the evolving relationships in temporal networks, thereby constructing an autoregressive-incorporated objective function. Additionally, a non-negative parameter learning scheme, based on a single latent factor-dependent, non-negative, and multiplicative update rule, is designed to ensure the non-negativity of the proposed model. The effectiveness of the ArNLFT model is ultimately verified through temporal link prediction tasks on two real CTNs, with results showing that ArNLFT achieves a significant accuracy improvement compared to its peers.

Authors

Institutions

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/icnsc62968.2024.10760012
Citations
1
Primary Topic
Tensor decomposition and applications
Type
article
Field-Weighted Citation Impact
0.33
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Autoregressive-incorporated Non-negative Latent Factorization of Tensors for Temporal Link Prediction in Cryptocurrency Transaction Network

Yi Ding, Yue Zhou, Yan Xia
1 citations
Tensor decomposition and applications
0.33
article

Autoregressive-incorporated Non-negative Latent Factorization of Tensors for Temporal Link Prediction in Cryptocurrency Transaction Network

Yi Ding, Yue Zhou, Yan Xia
article en
1 citations

Abstract

Cryptocurrency transaction networks (CTNs) are frequently encountered in real-world applications. Due to practical constraints, it is generally not feasible to observe complete interactions among all nodes at every time slot, leading to numerous missing links in CTNs. A link prediction model based on Non-negative Latent Factorization of Tensors (NLFT) has demonstrated effectiveness in predicting these missing links within a temporal network. However, existing NLFT models do not adequately capture the evolving relationships within a temporal network, limiting their ability to predict temporal links effectively. To address this limitation, this paper proposes an Autoregressive-incorporated Non-negative Latent-Factorization of Tensors (ArNLFT) model. The core idea is to adopt an autoregressive model to represent the evolving relationships in temporal networks, thereby constructing an autoregressive-incorporated objective function. Additionally, a non-negative parameter learning scheme, based on a single latent factor-dependent, non-negative, and multiplicative update rule, is designed to ensure the non-negativity of the proposed model. The effectiveness of the ArNLFT model is ultimately verified through temporal link prediction tasks on two real CTNs, with results showing that ArNLFT achieves a significant accuracy improvement compared to its peers.

Chongqing University of Posts and Telecommunications (CN), Southeast University (CN)
Openalex Percentile: Top 45%
Tensor decomposition and applications
0.33
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.