.png){kind=icon}
Return
A link prediction algorithm based on low-rank matrix completion
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-018-1220-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Link prediction is an essential research area in network analysis. Based on the technique of matrix completion, an algorithm for link prediction in networks is proposed. We propose a new model to describe matrix completion. In addition to the observed data, the model takes the noise matrix into account, which is important for detecting missing links. We propose an alternative iteration algorithm to solve matrix completion. The algorithm uses the proximal forward-backward splitting to minimize the nuclear and L (2,1) norm simultaneously. A random projected shrinkage operator on the singular values is defined, and an algorithm for implementing the projected shrinkage operator is presented. Using this operator, the time complexity of our algorithm is reduced greatly and reaches the lower bound of the time complexity for a similarity-based link prediction method. The empirical results of real-world networks show that the proposed algorithm can achieve higher quality prediction results than other algorithms.
Keywords:
Link prediction
Matrix completion
Low-rank
Data recovery
Data sparsity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.5
Papers:
7.6K
Citations:
1.7W
Organization
Cited Papers
Comparison of neuronal inositol 1,4,5-trisphosphate 3-kinase and receptor mRNA distributions in the adult rat brain using in situ hybridization histochemistry.png)
Neuroscience
NeuroscienceIF0
PREAI
ShareSave
ShareSaveShareSave
View more