Method and apparatus for obtaining L users having optimum communication influence

Abstract

The present invention discloses a method and apparatus for obtaining L users having optimum communication influence. The method and apparatus are used for simultaneously obtaining a plurality of users having the optimum communication influence, and information communication efficiency is improved. The method comprises the steps of obtaining structure data of a topology network from a network information database; representing the topology network as an undirected graph according to the structure data of the topology network; performing node assignment treatment on the undirected graph for t times according to preset repetition times t, wherein the node assignment treatment every time comprises bond percolation treatment on the undirected graph, and resource value assignment treatment after the bond percolation treatment; and ordering all nodes in the undirected graph on basis of total resource values obtained by the nodes from large to small after the node assignment treatment on the undirected graph is performed for t times, and selecting users corresponding to the top L nodes in the ordering as the L users having the optimum communication influence which are required to be obtained.

Description

technical field [0001] The present invention relates to the field of computer technology, in particular to a method and device for acquiring L users with the best communication influence. Background technique [0002] The development of social networks has a great impact on human life. Whether it is making friends, working or shopping, people have become accustomed to relying on social networks to obtain information. Users with high influence can be used as sources of information dissemination in social networks to promote the dissemination of effective information on social networks. In order to allow information to spread faster and wider in the network, the key is to find the most influential nodes. Due to the huge number of total users in the network, the complex network structure, and the extremely limited propagation capabilities of most nodes in the network, finding users with high propagation influence has always been a major challenge. Moreover, with the further e...

AI Technical Summary

Problems solved by technology

However, these methods all discretely calculate the influence value of a certain node. Although it can be used to distinguish which node spreads faster and has a wider range when a node is used as the source of communication, if multiple influential nodes are selected When all the nodes are used as the source of propagation at the same time, there are likely to be many overlapping areas in the propagation range of these nodes, so the overall propagation effect is not good

[0004] In the process of implementing the present invention, the inventors of the present invention found that the above-mentioned method of finding the user with the best communication influence can only be used to find a single user with the best communication influence in the network, but the dissemination of information in the network cannot rely solely on However, it is necessary to find a group of users with the best communication influence at the same time, and the existing above-mentioned methods cannot be applied to find multiple users with the best communication influence at the same time

Images