SA-Min: An Efficient Algorithm for Minimizing the Spread of Influence in a Social Network
暂无分享,去创建一个
Wei Zhang | Zhe Han | Ping Xuan | Yong Liu | Shengshu Shi
[1] Gao Cong,et al. Simulated Annealing Based Influence Maximization in Social Networks , 2011, AAAI.
[2] Wei Chen,et al. Efficient influence maximization in social networks , 2009, KDD.
[3] Shou-De Lin,et al. A Learning-based Framework to Handle Multi-round Multi-party Influence Maximization on Social Networks , 2015, KDD.
[4] Xiaokui Xiao,et al. Influence maximization: near-optimal time complexity meets practical efficiency , 2014, SIGMOD Conference.
[5] Matthew Richardson,et al. Mining the network value of customers , 2001, KDD '01.
[6] Jure Leskovec,et al. The dynamics of viral marketing , 2005, EC '06.
[7] Albert-László Barabási,et al. Error and attack tolerance of complex networks , 2000, Nature.
[8] Masahiro Kimura,et al. Minimizing the Spread of Contamination by Blocking Links in a Network , 2008, AAAI.
[9] Jon Kleinberg,et al. Maximizing the spread of influence through a social network , 2003, KDD '03.
[10] D S Callaway,et al. Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.
[11] Andreas Krause,et al. Cost-effective outbreak detection in networks , 2007, KDD '07.
[12] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[13] D. Mitra,et al. Convergence and finite-time behavior of simulated annealing , 1985, 1985 24th IEEE Conference on Decision and Control.