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...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Patent |
Sprache: | chi ; eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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 |
---|