关系张量分解：多关系链接预测的新方法
下载需积分: 9 | 888KB |
更新于2024-09-08
| 102 浏览量 | 5 评论 | 举报
收藏
立即下载 本文主要探讨了在多关系知识图谱（KG）中进行链接预测的一种新型方法——关系张量分解（Relational Tucker，简称RT）。关系张量分解是一种矩阵和张量的乘积表示形式，它将实体嵌入和关系嵌入的概念进行分离，打破了传统知识图谱模型中实体和关系嵌入大小固定的限制。RT模型允许不同关系之间参数共享，这意味着它可以更灵活地处理多对多的关系结构，而无需预设的稀疏性模式。
与现有的知识图谱嵌入模型（如TransE, DistMult, ComplEx等）相比，RT模型并不依赖于特定的稀疏性策略，而是提供了一个探索自动学习稀疏性模式的可能性。作者试图回答两个关键问题：一是能否通过RT分解自动学习出最佳的稀疏性模式，二是对于相同的参数数量，密集型模型（全连接模型）是否能够优于稀疏型模型。实验结果显示，答案取决于具体的数据集，某些情况下，自动学习到的稀疏性可以提高模型性能，而密集模型在某些条件下确实可以取得更好的预测效果。
RT分解的提出是针对多关系知识图谱中的复杂链接预测任务，它扩展了传统的知识表示框架，使得模型设计更具灵活性。它不仅提升了模型的适应性和泛化能力，而且为模型选择和优化提供了新的途径。通过对比实验，研究者们展示了RT分解作为一种强大的工具，可以帮助我们更好地理解在知识图谱建模中稀疏性与模型性能之间的关系，以及如何根据数据特性来调整模型架构。
这篇文章对关系张量分解在多关系知识图谱中的应用进行了深入研究，为未来知识图谱的链接预测和模型优化提供了新的思考角度。对于那些致力于提升知识图谱理解和预测准确性的研究人员来说，这篇文章的价值在于提供了实用的理论支持和实验依据，有助于推动该领域的进一步发展。
A Relational Tucker Decomposition for Multi-Relational Link Prediction
where
Re(·)
extracts the real part of a complex number.
Likewise, HolE (Nickel et al., 2016b) is equivalent to Com-
plEx (Hayashi & Shimbo, 2017). HolE uses the scoring
function
s(i,k, j) = r
T
k
(e
i
? e
j
)
, where
?
refers to the circu-
lar correlation between
e
i
and
e
j
∈ R
d
e
(i.e.,
(e
i
? e
j
)
k
=
∑
d
r
t=1
e
it
e
j((k+t−2 mod d
r
)+1)
). The idea of using circular cor-
relation relates to associative memory (Nickel et al., 2016b).
HolE uses as
M
HolE
k
the circumvent matrix resulting from
r
k
. In the remainder of this paper, we use the formulation
using M
ComplEx
k
given above.
Analogy (Liu et al., 2017b).
Analogy uses block-
diagonal mixing matrices
M
Analogy
k
, where each block
is either (1) a real scalar
x
or (2) a
2 × 2
matrix of
form
x −y
y x
, where
x,y ∈ R
refer to entries of
r
k
and
each entry of
r
k
appears in exactly one block. We have
d
r
= d
e
. Analogy aims to capture commutative relational
structure: the constraint ensures that
M
Analogy
k
1
M
Analogy
k
2
=
M
Analogy
k
2
M
Analogy
k
1
for all
k
1
,k
2
∈ R
. Both DistMult (only
first case allowed) and ComplEx (only second case allowed)
are special cases of Analogy.
3. The Relational Tucker3 Decomposition
In this section, we introduce the Relational Tucker3 (RT) de-
composition, which decomposes the KG into entity embed-
dings, relation embeddings, and a core tensor. We show that
each of the existing bilinear models can be viewed (1) as an
unconstrained RT decomposition with a fixed (sparse) core
tensor or (2) as a constrained RT decomposition with fixed
relation embeddings. In contrast to bilinear models, the RT
decomposition allows parameters sharing across different
relations, and it decouples the entity and relation embedding
sizes. Our experimental study (4) suggests that both proper-
ties can be beneficial. We also introduce a sparse variant of
RT called SRT to approach the question of whether we can
learn sparsity patterns of the core tensor from the data.
In what follows, we make use of the tensor representation
of KGs. In particular, we represent knowledge graph
K
via a binary tensor
X ∈ {0, 1}
N×N×K
, where
x
i jk
= 1
if
and only if
(i,k, j) ∈ K
. Note that if
x
i jk
= 0
, we assume
that the truth value of triple
(i,k, j)
is missing instead of
false. The scoring tensor of a particular embedding model
m
of
K
is the tensor
S ∈ R
N×N×K
of all predicted scores,
i.e., with
s
i jk
= s
m
(i,k, j)
. We use
A
k
to refer to the
k
-th
frontal slice of a 3-way tensor
A
. Note that
X
k
contains the
data for relation
k
, and that scoring matrix
S
k
contains the
respective predicted scores. Generally, embedding models
aim to construct scoring tensors
S
that suitably approximate
X (Nickel et al., 2016a).
3.1. Definition
We start with the classicial Tucker3 decomposition (Tucker,
1966), focusing on 3-way tensors throughout. The Tucker3
decomposition decomposes a given data tensor into three
factor matrices (one per mode) and a core tensor, which
stores the weights of the three-way interactions. The de-
composition can be can be viewed as a form of higher-order
PCA (Kolda & Bader, 2009). In more detail, given a tensor
D ∈ R
I×J×K
and sufficiently large parameters
d
a
,d
b
,d
c
∈ N
,
the Tucker3 decomposition factorizes
D
into factor matri-
ces
A ∈ R
I×d
a
,
B ∈ R
J×d
b
,
C ∈ R
K×d
c
, and core tensor
H ∈ R
d
a
×d
b
×d
c
such that
d
i jk
= a
T
i
[H ×
3
c
k
]b
j
,
where
H×
3
c
k
∈ R
d
a
×d
b
refers to the mode-3 tensor product
defined as
H ×
3
c
k
=
d
c
∑
l=1
c
kl
H
l
,
i.e., a linear combination of the frontal slices of
H
. If
d
a
,d
b
,d
c
are smaller than
I,J,K
, core tensor
H
can be inter-
preted as a compressed version of
D
. It is well-known that
the CP decomposition (Kolda & Bader, 2009) corresponds
to the special case where
d
a
= d
b
= d
c
and
H
is fixed to
the
d
a
× d
a
× d
a
tensor with
h
i jk
= 1
iff
i = j = k
, else 0.
The RT decomposition, which we introduce next, allows us
to view existing bilinear models as decompositions with a
fixed core tensor as well.
In particular, in KG embedding models, we associate each
entity with a single embedding, which we use to represent
the entity in both subject and object position. The relational
Tucker3 (RT) decomposition applies this approach to the
Tucker3 decomposition by enforcing
A = B
. In particular,
given embedding sizes
d
e
and
d
r
, the RT decomposition is
parameterized by an entity embedding matrix
E ∈ R
N×d
e
,
a relation embedding matrix
R ∈ R
K×d
r
, and a core tensor
G ∈ R
d
e
×d
e
×d
r
. As in the standard Tucker3 decomposition,
RT composes mixing matrices from the frontal slices of the
core tensor, i.e.,
M
RT
k
=
d
r
∑
l=1
r
kl
G
l
.
The scoring tensor has entries
s
i jk
= e
T
i
(G ×
3
r
k
)e
j
= e
T
i
M
RT
k
e
j
. (2)
Note that the mixing matrices for different relations share
parameters through the frontal slices of the core tensor.
The RT decomposition can represent any given tensor, i.e.,
the restriction on a single embedding per entity does not
limit expressiveness. To see this, suppose that we are given
a Tucker3 decomposition
A,B,C,H
of some tensor. Now
剩余11页未读，继续阅读
相关推荐
资源评论
南小鹏
2025.04.14
该研究对于目前的知识图谱嵌入模型进行了深入分析，并提出了更为先进的替代方案。
优游的鱼
2025.04.10
这份文档提出了Relational Tucker3（RT）分解用于知识图谱中的多关系链接预测，具有创新性并提高了模型的灵活性。👋
基鑫阁
2025.03.30
文档强调了RT分解在参数共享和实体关系嵌入大小解耦方面的优势，预示着该模型在实际应用中的巨大潜力。
贼仙呐
2025.03.23
文档详细探讨了RT分解在自动学习稀疏模式方面的潜力，为相关研究提供了新的方向。
武藏美-伊雯
2025.02.04
通过对不同数据集的实验，RT模型展示了其在多关系链接预测任务中的高效性和优越性。
Jayxp
- 粉丝: 6
我的内容管理
展开
最新资源
- wcm.io DevOps网站：掌握最新技术动态
- 深入理解Solidity中的Orderblock技术
- Udacity区块链课程：打造首个私有区块链项目
- Flutter入门项目：个人支出管理
- Final-Project：技术成果展示与分析
- CMO MetaDB CPT网关的技术实现与应用
- OpenBugBounty程序列表：范围与域解析
- 掌握Particle.js：JavaScript粒子效果实现教程
- 探索Python中的Lab2.02无用代码分析
- OWASP Web安全测试指南葡萄牙语版翻译发布
- 掌握GitHub：从入门到精通的教学指南
- Web开发大师课：回忆过去行为以备将来完成的应用指南
- JavaScript代码测验与部署评分标准
- 利用Markdown和git创建GitHub网站的简易教程
- Truffle框架下进行以太坊智能合约测试指南
- Ubuntu服务器部署多个WordPress网站教程
- SoE2021：打造环境报告的R包可视化工具
- 掌握Tailwind CSS：Ruby项目的构建与部署指南
- STA130课程W21W8期问题集解析
- Prisma Cloud IAC存储库1：扫描演示测试IAC模板
- 面向开发者的devLab3机器学习算法协作平台
- Tech-Store学习项目：深入理解HTML技术
- CSS技术在miguelaviza.github.io中的应用展示
- The Odin Project的Restaurant Page项目经验分享
