As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
Knowledge graph representation learning, also called knowledge graph embedding, is the task of mapping entities and relations into a low-dimensional, continuous vector space, and, as a result, can support various machine learning models to perform knowledge completion tasks with good performance and robustness. However, most of existing embedding models focus on improving the link prediction accuracy while ignoring the time-efficiency in search-intensive applications over large-scale knowledge graphs. To tackle this problem, in this paper, we encode knowledge graph into Hamming space and introduce a novel HAsh Learning Framework (HALF) for search-oriented knowledge graph embedding. The proposed method can be applied to recent various knowledge graph embedding models for accelerating the computation of searching embeddings by utilizing the bitwise operations (XNOR and Bitcount). Experimental results on benchmark datasets demonstrate the effectiveness of our proposed method, which gets a bonus of speed-up in the searching embeddings while the accuracy and scalability of the original model are basically maintained.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.