Structured embedding via pairwise relations and long-range interactions in knowledge base
- Publication Type:
- Conference Proceeding
- Proceedings of the National Conference on Artificial Intelligence, 2015, 2 pp. 1663 - 1670
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Open Access
This item is open access.
Copyright © 2015, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. We consider the problem of embedding entities and relations of knowledge bases into low-dimensional continuous vector spaces (distributed representations). Unlike most existing approaches, which are primarily efficient for modelling pairwise relations between entities, we attempt to explicitly model both pairwise relations and long-range interactions between entities, by interpreting them as linear operators on the low-dimensional embeddings of the entities. Therefore, in this paper we introduces path ranking to capture the long-range interactions of knowledge graph and at the same time preserve the pairwise relations of knowledge graph; we call it structured embedding via pairwise relation and /ong-range interactions (referred to as SePLi). Comparing with the-state-of-the-art models, SePLi achieves better performances of embeddings.
Please use this identifier to cite or link to this item: