Influence maximization method based on multi-layer potential and community structure

Abstract

The invention relates to an influence maximization method based on the multi-layer potential and community structure. According to the method, the influence propagation has two stages: multi-layer-potential-based expansion between communities at a first stage and influence propagation in communities at a second stage. To be specific, at the first stage, a seed node v tries to activate a neighbour node in a non-activated state, wherein the neighbour node is expresses as follows: {u|u belonging to N(v), active(u)=0}; the activated node during the process is marked as S1 (shown as a formula), wherein N(S) meets the following formula: N(S)=U(v belonging to S) N(v); and the S1 tries to activate another neighbour node in a non-activated state again, wherein the neighbour node is expresses as follows: {u|u belonging to N(S1)\S, activate(u)=0}, wherein the activated node is marked as S2. At the second stage, for a node expressed by a condition that any v belongs to the S2, the influence range of the node is limited in a communication where the node is located; for any communication Ci belonging to C, the influence scale depends on two factors: the value |Ci| of the community Ci and the numbe being intersection of the S2 and the Ci of the nodes, falling into the community, of the S2. According to the influence maximization method disclosed by the invention, the efficiency and the accuracy of the method are higher than thoes of the existing latest algorithms like an IPA algorithm and other heuristic algorithms.

Description

technical field

[0001] The invention belongs to the field of computer data mining, and in particular relates to a method for quickly solving the problem of maximizing influence by utilizing a community structure, and in particular relates to the problem of maximizing influence in a large-scale network. Background technique

[0002] Influence Maximization is an optimization problem about propagation. Whether it is the effective promotion of a company's new product or a certain concept, or the effective control of a certain virus or disaster, or other similar issues, it is inevitable to consider such a problem, how to use limited resources to achieve best results. Abstract in mathematical language is: for a given network G(V,E,W), (where V represents the set of nodes in the graph, E represents the set of edges in the graph, and W is the edge from the edge set E to the node set The weight corresponding to the mapping of the node pairs of V) Find a set S composed of k seed nod...

Images