Computer Science ›› 2021, Vol. 48 ›› Issue (3): 174-179.doi: 10.11896/jsjkx.191200154

• Database & Big Data & Data Science • Previous Articles     Next Articles

Technology Data Analysis Algorithm Based on Relational Graph

ZHANG Han-shuo, YANG Dong-ju   

  1. Beijing Key Laboratory on Integration and Analysis of Large-scale Stream Data,North China University of Technology,Beijing 100144,China
    Research Center for Cloud Computing,North China University of Technology,Beijing 100144,China
  • Received:2019-12-25 Revised:2020-05-28 Online:2021-03-15 Published:2021-03-05
  • About author:ZHANG Han-shuo,born in 1994,postgraduate.His main research interests include service computing,cloud computing and big data.
    YANG Dong-ju,born in 1975,Ph.D,associate professor,is a member of China Computer Federation.Her main research interests include service computing,data integration,cloud computing,cloud storage,and their applications in industry data center.
  • Supported by:
    National Key Research and Development Project of China(2019YFB1405103).

Abstract: With the continuous growth of scientific and technological data,various science and technology departments have accumulated a large number of scientific and technological management data of scientific and technological projects.For a large amount of structured data,it is necessary to organize and analyze the distributed data,and finally provide data query and extraction ser-vices according to requirements.The analysis of relationships in relational databases is not effective.In order to improve the efficiency of analysis,relational graphs are introduced for data processing.Firstly,an entity search and localization algorithm based on word frequency is proposed,and the entities and relationships are extracted to construct the relationalgraph.Secondly,an improved FP-growth algorithm for frequent item mining of graph data is proposed in order to solve the frequent item screening problem in the graph data.Then,a data filtering process based on graph data is designed.In addition,this paper defines the scoring matrix,evaluate the screening data,and finally give an analysis opinion.The evaluation standard of data screening can be customized.Finally,combined with the constructed relational graph,the algorithm is applied in practice and encapsulated as a ser-vice.Experimentalresults show that the improved FP-growth-based frequent item mining algorithm has 10%~12% improvement over the traditional FP-growth algorithm.The accuracy of the data screening process designed in this paper reaches 97%.

Key words: Construction of human relation graph, Data analysis, Data mining, Graph construction, Relational graph, Service application

CLC Number: 

  • TP391
[1]XU F.Research on spam speech recognition based on user social relationship graph [D].Wuhan:Huazhong University of Science and Technology,2017.
[2]AMIT S.Introducing the Knowledge Graph:Things,NotStrings,Official Blog [OL].[2019-06-14].http://googleblog.blogspot.co.uk/.
[3]TANG Y,CHEN G H,HE C B,et al.Knowledge Map and Its Application in the Field of Academic Information Services [J].Journal of South China Normal University(Natural Science Edition),2018,50(5):110-119.
[4]LING X,WELD D S.Fine-grained entity recognition[C]//Proc of the 26th Conf on Association for the Advancement of Artificial Intelligence.Menlo Park,CA:AAAI,2012:94-100.
[5]YIN L,YUAN F,XIE W B,et al.Research Progress and Challenges of Correlation Maps[J].Computer Science,2018,45(S1):1-10,35.
[6]JIANG B C,WAN G,XU J,et al.Construction of large-scale geo-graphic knowledge maps of multi-source heterogeneous data[J].Journal of Surveying and Mapping,2018,47(8):1051-1061.
[7]YAN J H,WANG C Y,CHENG W L,et al.A retrospective of knowledge graphs [J].Frontiers of Computer Science,2018,12(1):55-74.
[8]NATHAN E,BADER D A.Incrementally updating Katz centrality in dynamic graphs(Article)[J].Social Network Analysis and Mining,2018,8(1):1-26.
[9]LI X,TUR G,HAKKANI-TUR D,et al.Personal knowledgegraph population from user utterances in conversational understanding[C]//Spoken Language Technology Workshop.IEEE,2015.
[10]YU J,LIU Y B,ZHANG Y,et al.Overview of Large ScaleGraph Data Matching Technology[J].Journal of Computer Research and Development,2015,52(2):391-409.
[11]ZHANG L X,WANG W P,GAO J L,et al.Incremental Graph Pattern Matching for Pattern Graph Changes[J].Journal of Software,2015,26(11):2964-2980.
[12]GUAN J,WANG W,QI Q H.Multi-Keyword Streaming Parallel Retrieval Algorithm Based on Urban Security Knowledge Map[J].Computer Science,2019,46(2):35-41.
[13]SUN W P,CHANG L,BIN C Z,et al.Recommendations ofTourism Routes Based on Knowledge Mapping and Frequent Sequence Mining[J].Computer Science,2019,46(2):56-61.
[14]ZHAO Z B,JIA Y F,YAO L,et al.Research on Web Page Classification Technology with Rich Structured Data[J].Journal of Computer Research and Development,2013,50(S1):53-60.
[15]ZHANG Y,JIA Y D,FU L Y,et al.AceMap Academic Map and AceKG Academic Knowledge Atlas——Visualization of Academic Data [J].Journal of Shanghai Jiaotong University,2018,52(10):1357-1362.
[16]ZHENG W G,CHENG H Y,XU J,et al.Interactive natural language question answering over knowledge graphs[J].Information Sciences,2019,481:141-159.
[17]SHI D X,LI H,YANG R S,et al.Excavation of daily frequent behavior patterns of users[J].Journal of National University of Defense Technology,2017,39(1):74-80.
[18]FADER A,SODERLAND S,ETZIONI O.Identifying relations for Open information extraction[C]//Proc. of the Conf. on Empirical Methods in Natural Language Processing.Stroudsburg,PA:ACL,2011:1535-1545.
[1] LI Rong-fan, ZHONG Ting, WU Jin, ZHOU Fan, KUANG Ping. Spatio-Temporal Attention-based Kriging for Land Deformation Data Interpolation [J]. Computer Science, 2022, 49(8): 33-39.
[2] DENG Kai, YANG Pin, LI Yi-zhou, YANG Xing, ZENG Fan-rui, ZHANG Zhen-yu. Fast and Transmissible Domain Knowledge Graph Construction Method [J]. Computer Science, 2022, 49(6A): 100-108.
[3] CONG Ying-nan, WANG Zhao-yu, ZHU Jin-qing. Insights into Dataset and Algorithm Related Problems in Artificial Intelligence for Law [J]. Computer Science, 2022, 49(4): 74-79.
[4] YAO Xiao-ming, DING Shi-chang, ZHAO Tao, HUANG Hong, LUO Jar-der, FU Xiao-ming. Big Data-driven Based Socioeconomic Status Analysis:A Survey [J]. Computer Science, 2022, 49(4): 80-87.
[5] CAO He-xin, ZHAO Liang, LI Xue-feng. Technical Research of Graph Neural Network for Text-to-SQL Parsing [J]. Computer Science, 2022, 49(4): 110-115.
[6] KONG Yu-ting, TAN Fu-xiang, ZHAO Xin, ZHANG Zheng-hang, BAI Lu, QIAN Yu-rong. Review of K-means Algorithm Optimization Based on Differential Privacy [J]. Computer Science, 2022, 49(2): 162-173.
[7] LIANG Jing-ru, E Hai-hong, Song Mei-na. Method of Domain Knowledge Graph Construction Based on Property Graph Model [J]. Computer Science, 2022, 49(2): 174-181.
[8] JIANG Hao-chen, WEI Zi-qi, LIU Lin, CHEN Jun. Imbalanced Data Classification:A Survey and Experiments in Medical Domain [J]. Computer Science, 2022, 49(1): 80-88.
[9] ZHANG Ya-di, SUN Yue, LIU Feng, ZHU Er-zhou. Study on Density Parameter and Center-Replacement Combined K-means and New Clustering Validity Index [J]. Computer Science, 2022, 49(1): 121-132.
[10] MA Dong, LI Xin-yuan, CHEN Hong-mei, XIAO Qing. Mining Spatial co-location Patterns with Star High Influence [J]. Computer Science, 2022, 49(1): 166-174.
[11] YU Yue-zhang, XIA Tian-yu, JING Yi-nan, HE Zhen-ying, WANG Xiao-yang. Smart Interactive Guide System for Big Data Analytics [J]. Computer Science, 2021, 48(9): 110-117.
[12] HE Wen-qi, LIU Bao-long, SUN Zhao-chuan, WANG Lei, LI Dan-ping. Kernel-preserving Embedding Based Subspace Learning [J]. Computer Science, 2021, 48(6): 79-85.
[13] XU Hui-hui, YAN Hua. Relative Risk Degree Based Risk Factor Analysis Algorithm for Congenital Heart Disease in Children [J]. Computer Science, 2021, 48(6): 210-214.
[14] WU Guang-zhi, GUO Bin, DING Ya-san, CHENG Jia-hui, YU Zhi-wen. Cognitive Mechanisms of Fake News [J]. Computer Science, 2021, 48(6): 306-314.
[15] ZHANG Yan-jin, BAI Liang. Fast Symbolic Data Clustering Algorithm Based on Symbolic Relation Graph [J]. Computer Science, 2021, 48(4): 111-116.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!