Knowledge graph embedding by normalizing flows

A key to knowledge graph embedding (KGE) is to choose a proper representation space, e.g., point-wise Euclidean space and complex vector space. In this paper, we propose a unified perspective of embedding and introduce uncertainty into KGE from the view of group theory. Our model can incorporate exi...

Full description

Saved in:
Bibliographic Details
Main Authors: XIAO, Changyi, HE, Xiangnan, CAO, Yixin
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2022
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/8299
https://ink.library.smu.edu.sg/context/sis_research/article/9302/viewcontent/Knowledge_Graph_enhanced_Aspect_Based_Sentiment_Analysis_Final.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-9302
record_format dspace
spelling sg-smu-ink.sis_research-93022023-12-19T08:57:14Z Knowledge graph embedding by normalizing flows XIAO, Changyi HE, Xiangnan CAO, Yixin A key to knowledge graph embedding (KGE) is to choose a proper representation space, e.g., point-wise Euclidean space and complex vector space. In this paper, we propose a unified perspective of embedding and introduce uncertainty into KGE from the view of group theory. Our model can incorporate existing models (i.e., generality), ensure the computation is tractable (i.e., efficiency) and enjoy the expressive power of complex random variables (i.e., expressiveness). The core idea is that we embed entities/relations as elements of a symmetric group, i.e., permutations of a set. Permutations of different sets can reflect different properties of embedding. And the group operation of symmetric groups is easy to compute. In specific, we show that the embedding of many existing models, point vectors, can be seen as elements of a symmetric group. To reflect uncertainty, we first embed entities/relations as permutations of a set of random variables. A permutation can transform a simple random variable into a complex random variable for greater expressiveness, called a normalizing flow. We then define scoring functions by measuring the similarity of two normalizing flows, namely NFE. We construct several instantiating models and prove that they are able to learn logical rules. Experimental results demonstrate the effectiveness of introducing uncertainty and our model. 2022-02-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/8299 https://ink.library.smu.edu.sg/context/sis_research/article/9302/viewcontent/Knowledge_Graph_enhanced_Aspect_Based_Sentiment_Analysis_Final.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Complex random variables Embeddings Euclidean spaces Graph embeddings Knowledge graphs Point wise Representation space Space Vector Symmetric groups Uncertainty Databases and Information Systems
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Complex random variables
Embeddings
Euclidean spaces
Graph embeddings
Knowledge graphs
Point wise
Representation space
Space Vector
Symmetric groups
Uncertainty
Databases and Information Systems
spellingShingle Complex random variables
Embeddings
Euclidean spaces
Graph embeddings
Knowledge graphs
Point wise
Representation space
Space Vector
Symmetric groups
Uncertainty
Databases and Information Systems
XIAO, Changyi
HE, Xiangnan
CAO, Yixin
Knowledge graph embedding by normalizing flows
description A key to knowledge graph embedding (KGE) is to choose a proper representation space, e.g., point-wise Euclidean space and complex vector space. In this paper, we propose a unified perspective of embedding and introduce uncertainty into KGE from the view of group theory. Our model can incorporate existing models (i.e., generality), ensure the computation is tractable (i.e., efficiency) and enjoy the expressive power of complex random variables (i.e., expressiveness). The core idea is that we embed entities/relations as elements of a symmetric group, i.e., permutations of a set. Permutations of different sets can reflect different properties of embedding. And the group operation of symmetric groups is easy to compute. In specific, we show that the embedding of many existing models, point vectors, can be seen as elements of a symmetric group. To reflect uncertainty, we first embed entities/relations as permutations of a set of random variables. A permutation can transform a simple random variable into a complex random variable for greater expressiveness, called a normalizing flow. We then define scoring functions by measuring the similarity of two normalizing flows, namely NFE. We construct several instantiating models and prove that they are able to learn logical rules. Experimental results demonstrate the effectiveness of introducing uncertainty and our model.
format text
author XIAO, Changyi
HE, Xiangnan
CAO, Yixin
author_facet XIAO, Changyi
HE, Xiangnan
CAO, Yixin
author_sort XIAO, Changyi
title Knowledge graph embedding by normalizing flows
title_short Knowledge graph embedding by normalizing flows
title_full Knowledge graph embedding by normalizing flows
title_fullStr Knowledge graph embedding by normalizing flows
title_full_unstemmed Knowledge graph embedding by normalizing flows
title_sort knowledge graph embedding by normalizing flows
publisher Institutional Knowledge at Singapore Management University
publishDate 2022
url https://ink.library.smu.edu.sg/sis_research/8299
https://ink.library.smu.edu.sg/context/sis_research/article/9302/viewcontent/Knowledge_Graph_enhanced_Aspect_Based_Sentiment_Analysis_Final.pdf
_version_ 1787136836817125376