Learning Structured Embeddings of Knowledge Graphs with Adversarial Learning Framework
Jiehang Zeng, Lu Liu, Xiaoqing Zheng

TL;DR
This paper introduces an adversarial learning framework for embedding knowledge graphs into continuous vector spaces, enabling better link prediction and triple classification by generating and discriminating triples.
Contribution
It proposes a novel generative adversarial network approach that improves knowledge graph embeddings and can generate unseen instances, enhancing existing relational models.
Findings
Significant improvement over classical models like TransE in link prediction.
Effective generation of unseen triples for knowledge graph completion.
Enhanced triple classification accuracy.
Abstract
Many large-scale knowledge graphs are now available and ready to provide semantically structured information that is regarded as an important resource for question answering and decision support tasks. However, they are built on rigid symbolic frameworks which makes them hard to be used in other intelligent systems. We present a learning method using generative adversarial architecture designed to embed the entities and relations of the knowledge graphs into a continuous vector space. A generative network (GN) takes two elements of a (subject, predicate, object) triple as input and generates the vector representation of the missing element. A discriminative network (DN) scores a triple to distinguish a positive triple from those generated by GN. The training goal for GN is to deceive DN to make wrong classification. When arriving at a convergence, GN recovers the training data and can…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Topic Modeling · Complex Network Analysis Techniques
