Scalable Label Propagation for Multi-relational Learning on the Tensor Product of Graphs [journal]

Journal

IEEE Transactions on Knowledge and Data Engineering - March 4, 2021

Authors

Zhuliu Li (Ph.D. student), Raphael Petegrosso (Ph.D. 2019), Shaden Smith (Ph.D. 2019), David Sterling, George Karypis (professor), Rui Kuang (associate professor)

Abstract

Multi-relational learning on knowledge graphs infers high-order relations among the entities across the graphs. This learning task can be solved by label propagation on the tensor product of the knowledge graphs to learn the high-order relations as a tensor. In this paper, we generalize a widely used label propagation model to the normalized tensor product graph, and propose an optimization formulation and a scalable Low-rank Tensor-based Label Propagation algorithm (LowrankTLP) to infer multi-relations for two learning tasks, hyperlink prediction and multiple graph alignment. The optimization formulation minimizes the upper bound of the noisy tensor estimation error for multiple graph alignment, by learning with a subset of the eigen-pairs in the spectrum of the normalized tensor product graph. We also provide a data-dependent transductive Rademacher bound for binary hyperlink prediction. We accelerate LowrankTLP with parallel tensor computation which enables label propagation on a tensor product of 100 graphs each of size 1000 in less than half hour in the simulation. LowrankTLP was also applied to predicting the author-paper-venue hyperlinks in publication records, alignment of segmented regions across up to 26 CT-scan images and alignment of protein-protein interaction networks across multiple species. The experiments demonstrate that LowrankTLP indeed well approximates the original label propagation with better scalability and accuracy.

Link to full paper

Scalable Label Propagation for Multi-relational Learning on the Tensor Product of Graphs

Keywords

bioinformatics, computational biology, machine learning