Network content spreading method based on network node distributed Pagerank

Network content spreading method based on network node distributed Pagerank

The invention provides a network content spreading method based on network node distributed Pagerank. The method comprises the steps that 1, by taking each node in a network server as a center node, asubgraph of the connecting relation between the center node and network adjacent nodes is constructe...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: YOU JIALI, LIU XUE, WANG JINGLIN, XUE HANXING
Format: Patent
Sprache:chi ; eng
Schlagworte:
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator YOU JIALI
LIU XUE
WANG JINGLIN
XUE HANXING
description The invention provides a network content spreading method based on network node distributed Pagerank. The method comprises the steps that 1, by taking each node in a network server as a center node, asubgraph of the connecting relation between the center node and network adjacent nodes is constructed; 2, Pagerank values between any two nodes in the subgraphs are calculated; 3, according to an interaction operation between two nodes in the same subgraph, all the Pagerank values in the subgraph are calculated and updated; and 4, according to a set node spreading rule, two nodes corresponding tothe Pagerank value confirming to the rule are selected from each updated subgraph to spread network content. According to the network content spreading method, by setting one node which represents all other global information in each node neighbor connection relation graph to continuously iterate to gradually approach global information, the problem that the difference between a local model and the actual condition is too
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN108512765A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN108512765A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN108512765A3</originalsourceid><addsrcrecordid>eNrjZPD2Sy0pzy_KVkjOzytJzStRKC4oSk1MycxLV8hNLcnIT1FISixOTVHIz1PIg6rMy09JVUjJLC4pykwqLQHKBSSmpxYl5mXzMLCmJeYUp_JCaW4GRTfXEGcP3dSC_PjU4oLE5FSgGfHOfoYGFqaGRuZmpo7GxKgBAJHWNdM</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Network content spreading method based on network node distributed Pagerank</title><source>esp@cenet</source><creator>YOU JIALI ; LIU XUE ; WANG JINGLIN ; XUE HANXING</creator><creatorcontrib>YOU JIALI ; LIU XUE ; WANG JINGLIN ; XUE HANXING</creatorcontrib><description>The invention provides a network content spreading method based on network node distributed Pagerank. The method comprises the steps that 1, by taking each node in a network server as a center node, asubgraph of the connecting relation between the center node and network adjacent nodes is constructed; 2, Pagerank values between any two nodes in the subgraphs are calculated; 3, according to an interaction operation between two nodes in the same subgraph, all the Pagerank values in the subgraph are calculated and updated; and 4, according to a set node spreading rule, two nodes corresponding tothe Pagerank value confirming to the rule are selected from each updated subgraph to spread network content. According to the network content spreading method, by setting one node which represents all other global information in each node neighbor connection relation graph to continuously iterate to gradually approach global information, the problem that the difference between a local model and the actual condition is too</description><language>chi ; eng</language><subject>ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2018</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20180907&amp;DB=EPODOC&amp;CC=CN&amp;NR=108512765A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76289</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20180907&amp;DB=EPODOC&amp;CC=CN&amp;NR=108512765A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>YOU JIALI</creatorcontrib><creatorcontrib>LIU XUE</creatorcontrib><creatorcontrib>WANG JINGLIN</creatorcontrib><creatorcontrib>XUE HANXING</creatorcontrib><title>Network content spreading method based on network node distributed Pagerank</title><description>The invention provides a network content spreading method based on network node distributed Pagerank. The method comprises the steps that 1, by taking each node in a network server as a center node, asubgraph of the connecting relation between the center node and network adjacent nodes is constructed; 2, Pagerank values between any two nodes in the subgraphs are calculated; 3, according to an interaction operation between two nodes in the same subgraph, all the Pagerank values in the subgraph are calculated and updated; and 4, according to a set node spreading rule, two nodes corresponding tothe Pagerank value confirming to the rule are selected from each updated subgraph to spread network content. According to the network content spreading method, by setting one node which represents all other global information in each node neighbor connection relation graph to continuously iterate to gradually approach global information, the problem that the difference between a local model and the actual condition is too</description><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRICITY</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2018</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZPD2Sy0pzy_KVkjOzytJzStRKC4oSk1MycxLV8hNLcnIT1FISixOTVHIz1PIg6rMy09JVUjJLC4pykwqLQHKBSSmpxYl5mXzMLCmJeYUp_JCaW4GRTfXEGcP3dSC_PjU4oLE5FSgGfHOfoYGFqaGRuZmpo7GxKgBAJHWNdM</recordid><startdate>20180907</startdate><enddate>20180907</enddate><creator>YOU JIALI</creator><creator>LIU XUE</creator><creator>WANG JINGLIN</creator><creator>XUE HANXING</creator><scope>EVB</scope></search><sort><creationdate>20180907</creationdate><title>Network content spreading method based on network node distributed Pagerank</title><author>YOU JIALI ; LIU XUE ; WANG JINGLIN ; XUE HANXING</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN108512765A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2018</creationdate><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>YOU JIALI</creatorcontrib><creatorcontrib>LIU XUE</creatorcontrib><creatorcontrib>WANG JINGLIN</creatorcontrib><creatorcontrib>XUE HANXING</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>YOU JIALI</au><au>LIU XUE</au><au>WANG JINGLIN</au><au>XUE HANXING</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Network content spreading method based on network node distributed Pagerank</title><date>2018-09-07</date><risdate>2018</risdate><abstract>The invention provides a network content spreading method based on network node distributed Pagerank. The method comprises the steps that 1, by taking each node in a network server as a center node, asubgraph of the connecting relation between the center node and network adjacent nodes is constructed; 2, Pagerank values between any two nodes in the subgraphs are calculated; 3, according to an interaction operation between two nodes in the same subgraph, all the Pagerank values in the subgraph are calculated and updated; and 4, according to a set node spreading rule, two nodes corresponding tothe Pagerank value confirming to the rule are selected from each updated subgraph to spread network content. According to the network content spreading method, by setting one node which represents all other global information in each node neighbor connection relation graph to continuously iterate to gradually approach global information, the problem that the difference between a local model and the actual condition is too</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language chi ; eng
recordid cdi_epo_espacenet_CN108512765A
source esp@cenet
subjects ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
title Network content spreading method based on network node distributed Pagerank
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T08%3A16%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=YOU%20JIALI&rft.date=2018-09-07&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN108512765A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true