A method and system for sorting the importance of nodes

Abstract

The embodiment of the invention discloses a node importance ranking method and system. The method provided by the embodiment of the invention comprises following steps of obtaining node log information interacted among the nodes in a topology network from a node application server; adding a cum right and a direction in the topology network according to the node log information, thus obtaining a directed cum right network; adding background nodes in the directed cum right network, thus obtaining the directed cum right network added with the background nodes, wherein two-way link relations are built between the background nodes and all original nodes in the directed cum right network; ranking the importance of each node according to the directed cum right network added with the background nodes, thus obtaining the importance ranking of each node.

Description

technical field [0001] The invention relates to the field of computer technology, in particular to a method and system for sorting the importance of nodes. Background technique [0002] Mining important users in social networks is realized by sorting the importance of nodes in the network, and different social networking sites will define and calculate the importance according to different application scenarios. The ordering of node importance in the network is a very important issue, for example, the ordering of web pages is the core of search algorithms. [0003] In the prior art, there is a method for sorting nodes in a link database, which can be used to sort the importance of nodes. This method is the US Patent No. 6,285,999B1 invented by Lawrence Page, namely "the method for sorting nodes in a link database" (English full name is METHOD FOR NODE RANKING IN A LINKED DATABASE), referred to as the PageRank algorithm, which is used to identify the level / importance of web ...

AI Technical Summary

Problems solved by technology

It can be seen that the calculation of the authority value and the central value in the HITS algorithm depends on the mutual link relationship between nodes, so the problem with the HITS algorithm is that it cannot be applied to the ranking of the importance of nodes in a network containing multiple groups, because each There is no link between groups, it is difficult to say that one group is more important than another group, so it is impossible to determine which node is more authoritative or central among the multi-nodes across groups

[0006] In summary, none of the node importance ranking methods in the prior art can be fully applied to mining important users in social networks. At present, the industry still urgently needs to develop a node importance ranking method that can be fully applied to mining important users in social networks.

Images