An Adaptive Seed Node Mining Algorithm Based on Graph Clustering to Maximize the Influence of Social Networks

摘要

Recently, the issue of maximizing the influence of social networks is a hot topic. In large-scale social networks, the mining algorithm for maximizing influence seed nodes has made great progress, but only using influence as the evaluation criterion of seed nodes is not enough to reflect the quality of seed nodes. This paper proposes an Out-degree Graph Clustering algorithm (OGC algorithm) to dynamically select the out-degree boundary to optimize the range of clustering. On this basis, we propose an Adaptive Seed node Mining algorithm based on Out-degree (ASMO algorithm). Experiments show that our algorithm keeps the balance between the cost and benefit of seed node mining, and greatly shortens the running time of seed node mining.