Log-Normal Matrix Completion for Large Scale Link Prediction

by   Brian Mohtashemi, et al.

The ubiquitous proliferation of online social networks has led to the widescale emergence of relational graphs expressing unique patterns in link formation and descriptive user node features. Matrix Factorization and Completion have become popular methods for Link Prediction due to the low rank nature of mutual node friendship information, and the availability of parallel computer architectures for rapid matrix processing. Current Link Prediction literature has demonstrated vast performance improvement through the utilization of sparsity in addition to the low rank matrix assumption. However, the majority of research has introduced sparsity through the limited L1 or Frobenius norms, instead of considering the more detailed distributions which led to the graph formation and relationship evolution. In particular, social networks have been found to express either Pareto, or more recently discovered, Log Normal distributions. Employing the convexity-inducing Lovasz Extension, we demonstrate how incorporating specific degree distribution information can lead to large scale improvements in Matrix Completion based Link prediction. We introduce Log-Normal Matrix Completion (LNMC), and solve the complex optimization problem by employing Alternating Direction Method of Multipliers. Using data from three popular social networks, our experiments yield up to 5 AUC increase over top-performing non-structured sparsity based methods.


page 1

page 2

page 3

page 4


Understanding the network formation pattern for better link prediction

As a classical problem in the field of complex networks, link prediction...

Graph embeddings via matrix factorization for link prediction: smoothing or truncating negatives?

Link prediction – the process of uncovering missing links in a complex n...

A Novel Location Free Link Prediction in Multiplex Social Networks

In recent decades, the emergence of social networks has enabled internet...

Link Prediction in Graphs with Autoregressive Features

In the paper, we consider the problem of link prediction in time-evolvin...

Network Topology Mapping from Partial Virtual Coordinates and Graph Geodesics

For many important network types (e.g., sensor networks in complex harsh...

Recover the lost Phasor Measurement Unit Data Using Alternating Direction Multipliers Method

This paper presents a novel algorithm for recovering missing data of pha...

A Neural Network for Semigroups

Tasks like image reconstruction in computer vision, matrix completion in...

Please sign up or login with your details

Forgot password? Click here to reset