A method and device for obtaining l users with the best communication influence

Abstract

The invention discloses a method and a device for acquiring L users with the best communication influence, which are used to simultaneously acquire a plurality of users with the best communication influence and improve the efficiency of information dissemination. In the method provided by the present invention, the structural data of the topological network is obtained from the network information database, the topological network is represented as an undirected graph according to the structural data of the topological network, and the undirected graph is recreated t times according to the preset number of repetitions t. Node assignment processing, wherein each node assignment processing includes: performing edge percolation processing on the undirected graph, and resource value allocation processing after the edge percolation processing, after performing t node assignment processing on the undirected graph, the All nodes in the undirected graph are sorted from large to small according to the total resource value obtained by each node, and the users corresponding to the first L nodes in the sorting are the L users with the best communication influence that need to be acquired.

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