Influence maximization problem for unknown social networks

@article{Mihara2015InfluenceMP,
  title={Influence maximization problem for unknown social networks},
  author={Shodai Mihara and Sho Tsugawa and Hiroyuki Ohsaki},
  journal={2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)},
  year={2015},
  pages={1539-1546}
}
We propose a novel problem called influence maximization for unknown graphs, and propose a heuristic algorithm for the problem. Influence maximization is the problem of detecting a set of influential nodes in a social network, which represents social relationships among individuals. Influence maximization has been actively studied, and several algorithms have been proposed in the literature. The existing algorithms use the entire topological structure of a social network. In practice, however… CONTINUE READING

5 Figures & Tables

Topics

Statistics

0102020172018
Citations per Year

Citation Velocity: 9

Averaging 9 citations per year over the last 2 years.

Learn more about how we calculate this metric in our FAQ.