Logistic Tensor Factorization for Multi-Relational Data

06/10/2013
by   Maximilian Nickel, et al.
0

Tensor factorizations have become increasingly popular approaches for various learning tasks on structured data. In this work, we extend the RESCAL tensor factorization, which has shown state-of-the-art results for multi-relational learning, to account for the binary nature of adjacency tensors. We study the improvements that can be gained via this approach on various benchmark datasets and show that the logistic extension can improve the prediction results significantly.

READ FULL TEXT

page 1

page 2

page 3

research
11/06/2021

A Probit Tensor Factorization Model For Relational Learning

With the proliferation of knowledge graphs, modeling data with complex m...
research
12/15/2014

Bayesian multi-tensor factorization

We introduce Bayesian multi-tensor factorization, a model that is the fi...
research
04/21/2021

Searching to Sparsify Tensor Decomposition for N-ary Relational Data

Tensor, an extension of the vector and matrix to the multi-dimensional c...
research
08/18/2015

Zero-Truncated Poisson Tensor Factorization for Massive Binary Tensors

We present a scalable Bayesian model for low-rank factorization of massi...
research
07/24/2019

Semi-Supervised Tensor Factorization for Node Classification in Complex Social Networks

This paper proposes a method to guide tensor factorization, using class ...
research
02/13/2018

Neural Tensor Factorization

Neural collaborative filtering (NCF) and recurrent recommender systems (...
research
02/08/2019

PASTA: A Parallel Sparse Tensor Algorithm Benchmark Suite

Tensor methods have gained increasingly attention from various applicati...

Please sign up or login with your details

Forgot password? Click here to reset