基于节点混合阻塞力的影响阻塞最大化算法OA北大核心CSTPCD

To solve the problem of influence blocking maximization in social networks,the concept of mixed blocking force of nodes based on the competitive independent cascade model was introduced,then a greedy heuristic was proposed.With the help of the existing method for calculating the influence probability of nodes,new measures for the blocking ability and diffusion ability of nodes were given,which were used to describe the impact of nodes on the spread of negative information and positive information respectively.Combining with these two capabilities,the mixed blocking force of a node can be calculated.The greedy algorithm selected a node with the largest mixed blocking force as a blocking node during each iteration.Compared with several existing algorithms,it can be seen that these blocking nodes selected by the greedy algorithm have better effective in blocking negative information on classic social network instances.