Parallel tensor factorization for relational learning

Document Type

Article

Source of Publication

Neural Computing and Applications

Publication Date

1-27-2021

Abstract

Link prediction is a statistical relational learning problem that has a variety of applications in recommender systems, expert systems, and knowledge bases. Numerous approaches have already been devised to solve the problem. Tensor factorization is one of the ways to solve the link prediction problem. Many tensor factorization techniques have been devised in the last few decades, including Tucker, CANDECOMP/PARAFAC, and DEDICOM. RESCAL is one of the famous tensor factorization technique that can solve large scale problems with relatively less time and space complexity. The time complexity of RESCAL can further be reduced by making it parallel. This variant can also be applied to large scale datasets. This article focuses on devising a parallel version for RESCAL. A decent decrease in execution time has been observed in the execution of parallel RESCAL.

ISSN

0941-0643

Publisher

Springer Science and Business Media Deutschland GmbH

Disciplines

Computer Sciences

Keywords

Expert systems, Factorization, Large dataset, Knowledge basis, Large-scale datasets, Large-scale problem, Parallel version, Relational learning, Statistical relational learning, Tensor factorization, Time and space complexity, Tensors

Scopus ID

85099904919

Indexed in Scopus

yes

Open Access

no

Link to Full Text

Share

COinS