Technology Data Analysis Algorithm Based on Relational Graph

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 an...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Ji suan ji ke xue 2021-01, Vol.48 (3), p.174
Hauptverfasser:	Zhang, Han-Shuo, Yang, Dong-Ju
Format:	Artikel
Sprache:	chi
Schlagworte:	Algorithms Data analysis Data processing Relational data bases Screening Technology assessment
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page
container_issue	3
container_start_page	174
container_title	Ji suan ji ke xue
container_volume	48
creator	Zhang, Han-Shuo Yang, Dong-Ju
description	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 matri
format	Article
fullrecord	<record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2504819494</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2504819494</sourcerecordid><originalsourceid>FETCH-proquest_journals_25048194943</originalsourceid><addsrcrecordid>eNpjYeA0NDAw0jU0No_gYOAtLs5MMjAyNjMBQkNOBpuQ1OSMvPyc_PRKBZfEkkQFx7zEnMrizGIFx5z0_KLMkoxcBafE4tQUhfw8haDUnMSSzHygCgX3osSCDB4G1rTEnOJUXijNzaDs5hri7KFbUJRfWJpaXBKflV9aBFReHG9kamBiYWhpYmliTJwqAEeON4k</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2504819494</pqid></control><display><type>article</type><title>Technology Data Analysis Algorithm Based on Relational Graph</title><source>DOAJ Directory of Open Access Journals</source><creator>Zhang, Han-Shuo ; Yang, Dong-Ju</creator><creatorcontrib>Zhang, Han-Shuo ; Yang, Dong-Ju</creatorcontrib><description>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 matri</description><identifier>ISSN: 1002-137X</identifier><language>chi</language><publisher>Chongqing: Guojia Kexue Jishu Bu</publisher><subject>Algorithms ; Data analysis ; Data processing ; Relational data bases ; Screening ; Technology assessment</subject><ispartof>Ji suan ji ke xue, 2021-01, Vol.48 (3), p.174</ispartof><rights>Copyright Guojia Kexue Jishu Bu 2021</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780</link.rule.ids></links><search><creatorcontrib>Zhang, Han-Shuo</creatorcontrib><creatorcontrib>Yang, Dong-Ju</creatorcontrib><title>Technology Data Analysis Algorithm Based on Relational Graph</title><title>Ji suan ji ke xue</title><description>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 matri</description><subject>Algorithms</subject><subject>Data analysis</subject><subject>Data processing</subject><subject>Relational data bases</subject><subject>Screening</subject><subject>Technology assessment</subject><issn>1002-137X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><recordid>eNpjYeA0NDAw0jU0No_gYOAtLs5MMjAyNjMBQkNOBpuQ1OSMvPyc_PRKBZfEkkQFx7zEnMrizGIFx5z0_KLMkoxcBafE4tQUhfw8haDUnMSSzHygCgX3osSCDB4G1rTEnOJUXijNzaDs5hri7KFbUJRfWJpaXBKflV9aBFReHG9kamBiYWhpYmliTJwqAEeON4k</recordid><startdate>20210101</startdate><enddate>20210101</enddate><creator>Zhang, Han-Shuo</creator><creator>Yang, Dong-Ju</creator><general>Guojia Kexue Jishu Bu</general><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20210101</creationdate><title>Technology Data Analysis Algorithm Based on Relational Graph</title><author>Zhang, Han-Shuo ; Yang, Dong-Ju</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_25048194943</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>chi</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Data analysis</topic><topic>Data processing</topic><topic>Relational data bases</topic><topic>Screening</topic><topic>Technology assessment</topic><toplevel>online_resources</toplevel><creatorcontrib>Zhang, Han-Shuo</creatorcontrib><creatorcontrib>Yang, Dong-Ju</creatorcontrib><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Ji suan ji ke xue</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhang, Han-Shuo</au><au>Yang, Dong-Ju</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Technology Data Analysis Algorithm Based on Relational Graph</atitle><jtitle>Ji suan ji ke xue</jtitle><date>2021-01-01</date><risdate>2021</risdate><volume>48</volume><issue>3</issue><spage>174</spage><pages>174-</pages><issn>1002-137X</issn><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 matri</abstract><cop>Chongqing</cop><pub>Guojia Kexue Jishu Bu</pub></addata></record>
fulltext	fulltext
identifier	ISSN: 1002-137X
ispartof	Ji suan ji ke xue, 2021-01, Vol.48 (3), p.174
issn	1002-137X
language	chi
recordid	cdi_proquest_journals_2504819494
source	DOAJ Directory of Open Access Journals
subjects	Algorithms Data analysis Data processing Relational data bases Screening Technology assessment
title	Technology Data Analysis Algorithm Based on Relational Graph
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T12%3A48%3A24IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Technology%20Data%20Analysis%20Algorithm%20Based%20on%20Relational%20Graph&rft.jtitle=Ji%20suan%20ji%20ke%20xue&rft.au=Zhang,%20Han-Shuo&rft.date=2021-01-01&rft.volume=48&rft.issue=3&rft.spage=174&rft.pages=174-&rft.issn=1002-137X&rft_id=info:doi/&rft_dat=%3Cproquest%3E2504819494%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2504819494&rft_id=info:pmid/&rfr_iscdi=true