Research on Construction and Evolution of Relational Graph of the Science and Technology Data

Hanshuo Zhang, Dongju Yang
{"title":"Research on Construction and Evolution of Relational Graph of the Science and Technology Data","authors":"Hanshuo Zhang, Dongju Yang","doi":"10.1109/ICCC47050.2019.9064386","DOIUrl":null,"url":null,"abstract":"In recent years, the amount of scientific and technological data has been increasing, and the requirements for data analysis have been continuously improved. Among of them, the mining of data association relations and the construction and evolution of relational models are the research hotspots in recent years. How to obtain entities and their relationships from massive data, and then use the relational model to construct the relational graph and support the evolution of the graph is the key problem to be solved. Aiming at the above problems, this paper proposes a method for constructing and evolving relational graphs based on structured data, including source data preprocessing, entity and attribute identification, information extraction, relationship matching, and relational graph construction and evolution. The evolution and update algorithm of the graph based on Simhash and Hamming distance is proposed, and the update strategy of the entity similarity in the graph is analyzed. Combined with experimental verification, this method can automatically realize the extraction of structured data, the construction of relational graph and the evolution and update process of the graph, and the accuracy of the results was about 97%.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"1 1","pages":"1921-1926"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCC47050.2019.9064386","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In recent years, the amount of scientific and technological data has been increasing, and the requirements for data analysis have been continuously improved. Among of them, the mining of data association relations and the construction and evolution of relational models are the research hotspots in recent years. How to obtain entities and their relationships from massive data, and then use the relational model to construct the relational graph and support the evolution of the graph is the key problem to be solved. Aiming at the above problems, this paper proposes a method for constructing and evolving relational graphs based on structured data, including source data preprocessing, entity and attribute identification, information extraction, relationship matching, and relational graph construction and evolution. The evolution and update algorithm of the graph based on Simhash and Hamming distance is proposed, and the update strategy of the entity similarity in the graph is analyzed. Combined with experimental verification, this method can automatically realize the extraction of structured data, the construction of relational graph and the evolution and update process of the graph, and the accuracy of the results was about 97%.
科技数据关系图的构建与演化研究
近年来,科技数据量不断增加,对数据分析的要求也不断提高。其中,数据关联关系的挖掘和关系模型的构建与演化是近年来的研究热点。如何从海量数据中获取实体及其关系,然后利用关系模型构建关系图并支持关系图的演化是需要解决的关键问题。针对上述问题,本文提出了一种基于结构化数据的关系图构建与演化方法,包括源数据预处理、实体与属性识别、信息提取、关系匹配、关系图构建与演化。提出了基于Simhash和Hamming距离的图演化与更新算法,并分析了图中实体相似度的更新策略。结合实验验证,该方法可以自动实现结构化数据的提取、关系图的构建以及关系图的演化和更新过程,结果的准确率达到97%左右。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信