检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:林泽斐 欧石燕[1] Lin Zefei;Ou Shiyan(School of Information Management,Nanjing University,Nanjing 210093;College of Social Development,Fujian Normal University,Fuzhou 350007)
机构地区:[1]南京大学信息管理学院,南京210093 [2]福建师范大学社会发展学院,福州350007
出 处:《图书情报工作》2020年第21期99-110,共12页Library and Information Service
基 金:国家社会科学基金重点项目"基于关联数据的学术文献内容语义发布及其应用研究"(项目编号:17ATQ001)研究成果之一。
摘 要:[目的/意义]提出一种融合内部结构特征和外部文本特征的知识图谱关系预测新方法,旨在预测知识图谱中两实体间缺失关系的类型。[方法/过程]将关系路径和反映实体间关系的文本矩阵化,通过卷积神经网络学习与特定关系类型相关的结构和文本模式特征,在此基础上训练模型实现关系预测。[结果/结论]实验结果显示,该方法在评测数据集上的性能表现超过对照方法的水平,可有效提升知识图谱关系预测的性能。通过实际应用发现,该方法在知识服务中具有良好的应用价值。[Purpose/significance]Relation prediction is an important task in knowledge graph completion,and plays an important role in improving the completeness of knowledge in knowledge graphs.The paper proposes a new relation prediction method that combines internal structure features and external text features,which aims to predict the missing relations between two entities in knowledge graphs.[Method/process]The method transforms the relation paths in a knowledge graph and the texts that involve entity relationships into matrixes,learns the structure features and text pattern features related to a specific relation type through convolutional neural networks,and then trains a model based on the learned features for relation prediction.[Result/conclusion]The results shows that the performance of our proposed method on evaluation data sets is superior to the state-of-the-art approaches,and the method can effectively improves the performance of knowledge graph relationship prediction.Through practical application,it wvas found that this method has high application value in knowledge services.
分 类 号:G254.29[文化科学—图书馆学] TP391.1[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222