A General Solution and Practice for Automatically Constructing Domain Knowledge Graph

Xiaomin Yang, Shuai Zhao, B. Cheng, Xu Wang, Jianchang Ao, Zhenzi Li, Zeyan Cao
{"title":"A General Solution and Practice for Automatically Constructing Domain Knowledge Graph","authors":"Xiaomin Yang, Shuai Zhao, B. Cheng, Xu Wang, Jianchang Ao, Zhenzi Li, Zeyan Cao","doi":"10.1109/ICCC51575.2020.9344946","DOIUrl":null,"url":null,"abstract":"A knowledge graph is a semantic network that reveals the relationships between entities. Domain knowledge graphs can assist practitioners in complex analysis applications and decision support, and build industry barriers. A good construction system can help companies construct domain knowledge graphs efficiently and quickly. However, due to the differences in data models and business requirements in different fields, there is no general method for constructing a domain knowledge graph. Moreover, the current construction methods require a lot of manpower investment, which is relatively inefficient. To solve the inefficiency and nonuniversal problems in the process of domain knowledge graph construction, in this paper, we study the automated construction mechanism of Chinese domain knowledge graphs and propose a general automatic construction solution. Experimental results show that our proposed solution is more effective in constructing a domain knowledge graph.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCC51575.2020.9344946","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A knowledge graph is a semantic network that reveals the relationships between entities. Domain knowledge graphs can assist practitioners in complex analysis applications and decision support, and build industry barriers. A good construction system can help companies construct domain knowledge graphs efficiently and quickly. However, due to the differences in data models and business requirements in different fields, there is no general method for constructing a domain knowledge graph. Moreover, the current construction methods require a lot of manpower investment, which is relatively inefficient. To solve the inefficiency and nonuniversal problems in the process of domain knowledge graph construction, in this paper, we study the automated construction mechanism of Chinese domain knowledge graphs and propose a general automatic construction solution. Experimental results show that our proposed solution is more effective in constructing a domain knowledge graph.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
领域知识图自动构建的一般解决方案与实践
知识图谱是一个揭示实体之间关系的语义网络。领域知识图可以帮助从业者进行复杂的分析应用程序和决策支持,并建立行业壁垒。一个好的构建系统可以帮助企业高效、快速地构建领域知识图谱。然而,由于不同领域的数据模型和业务需求存在差异,构建领域知识图尚无通用的方法。而且,目前的施工方法需要大量的人力投入,效率相对较低。为了解决领域知识图构建过程中存在的低效率和非通用性问题,本文研究了中文领域知识图的自动化构建机制,提出了一种通用的领域知识图自动化构建方案。实验结果表明,该方法在构建领域知识图方面具有较好的效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Safe and Stable Timing Method over Air Interface Based on Multi-Base Station Cooperation Peak to Average Power Ratio (PAPR) Mitigation for Underwater Acoustic OFDM System by Using an Efficient Hybridization Technique Monocular Visual-Inertial Odometry Based on Point and Line Features Block Halftoning for Size-Invariant Visual Cryptography Based on Two-Dimensional Lattices Airborne STAP with Unknown Mutual Coupling for Coprime Sampling Structure
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1