| Popis: |
The Influence maximization problem is a fundamental problem in social networks analysis which aims to select a small set of nodes, as a seed set, and maximizes influence spread through the seed set under a specific propagation model. In this paper, the effect of performing vertex cover, as a preprocess, has been investigated on the influence maximization algorithms under the independent cascade model. Proposed method eliminates ineffective nodes from the main calculation process to find the most influential nodes. Based on the results, combining the proposed algorithm with several methods on real-world datasets confirms the efficiency of the method. |
