Joint learning based on multi-shaped filters for knowledge graph completion

来源 :高技术通讯(英文版) | 被引量 : 0次 | 上传用户:yztny
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
To solve the problem of missing many valid triples in knowledge graphs(KGs),a novel model based on a convolutional neural network(CNN)called ConvKG is proposed,which employs a joint learning strategy for knowledge graph completion(KGC).Related research work has shown the su-periority of convolutional neural networks(CNNs)in extracting semantic features of triple embed-dings.However,these researches use only one single-shaped filter and fail to extract semantic fea-tures of different granularity.To solve this problem,ConvKG exploits multi-shaped filters to co-con-volute on the triple embeddings,joint learning semantic features of different granularity.Different shaped filters cover different sizes on the triple embeddings and capture pairwise interactions of dif-ferent granularity among triple elements.Experimental results confirm the strength of joint learning,and compared with state-of-the-art CNN-based KGC models,ConvKG achieves the better mean rank(MR)and Hits@10 metrics on dataset WN18RR,and the better MR on dataset FB15k-237.
其他文献