Subscribe
Issue No.01 - Jan. (2014 vol.25)
pp: 136-145
Xiaodong Liu , Sch. of Comput., Nat. Univ. of Defense Technol., Changsha, China
Mo Li , Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore, Singapore
Shanshan Li , Sch. of Comput., Nat. Univ. of Defense Technol., Changsha, China
Shaoliang Peng , Sch. of Comput., Nat. Univ. of Defense Technol., Changsha, China
Xiangke Liao , Sch. of Comput., Nat. Univ. of Defense Technol., Changsha, China
Xiaopei Lu , Sch. of Comput., Nat. Univ. of Defense Technol., Changsha, China
ABSTRACT
Influence Maximization aims to find the top-$(K)$ influential individuals to maximize the influence spread within a social network, which remains an important yet challenging problem. Proven to be NP-hard, the influence maximization problem attracts tremendous studies. Though there exist basic greedy algorithms which may provide good approximation to optimal result, they mainly suffer from low computational efficiency and excessively long execution time, limiting the application to large-scale social networks. In this paper, we present IMGPU, a novel framework to accelerate the influence maximization by leveraging the parallel processing capability of graphics processing unit (GPU). We first improve the existing greedy algorithms and design a bottom-up traversal algorithm with GPU implementation, which contains inherent parallelism. To best fit the proposed influence maximization algorithm with the GPU architecture, we further develop an adaptive K-level combination method to maximize the parallelism and reorganize the influence graph to minimize the potential divergence. We carry out comprehensive experiments with both real-world and sythetic social network traces and demonstrate that with IMGPU framework, we are able to outperform the state-of-the-art influence maximization algorithm up to a factor of 60, and show potential to scale up to extraordinarily large-scale networks.
INDEX TERMS
Graphics processing units, Social network services, Parallel processing, Acceleration, Instruction sets, Computational modeling, Accuracy,bottom-up traversal algorithm, Influence maximization, GPU, large-scale social networks, IMGPU
CITATION
Xiaodong Liu, Mo Li, Shanshan Li, Shaoliang Peng, Xiangke Liao, Xiaopei Lu, "IMGPU: GPU-Accelerated Influence Maximization in Large-Scale Social Networks", IEEE Transactions on Parallel & Distributed Systems, vol.25, no. 1, pp. 136-145, Jan. 2014, doi:10.1109/TPDS.2013.41
REFERENCES
 [1] J. Barnat, P. Bauch, L. Brim, and M. Ceska, "Computing Strongly Connected Components in Parallel on CUDA," Proc. IEEE 25th Int'l Parallel Distributed Processing Symp. (IPDPS), pp. 544-555, 2011. [2] D. Bader and K. Madduri, "GTgraph: A Suite of Synthetic Graph Generators," http://www.cse.psu.edu/madduri/softwareGTgraph /, Nov. 2012. [3] N. Bell and M. Garland, "Efficient Sparse Matrix-Vector Multiplication on CUDA," Technical Report NVR-2008-04, NVIDIA, Dec. 2008. [4] W. Chen, Y. Wang, and S. Yang, "Efficient Influence Maximization in Social Networks," Proc. ACM Int'l Conf. Knowledge Discovery and Data Mining (SIGKDD), pp. 199-208, 2009. [5] W. Chen, C. Wang, and Y. Wang, "Scalable Influence Maximization for Prevalent Viral Marketing in Large-Scale Social Networks," Proc. ACM Int'l Conf. Knowledge Discovery and Data Mining (SIGKDD), pp. 1029-1038, 2010. [6] E. Cohen, "Size-Estimation Framework with Applications to Transitive Closure and Reachability," J. Computer and System Sciences, vol. 55, no. 3, pp. 441-453, 1997. [7] P. Domingos and M. Richardson, "Mining the Network Value of Customers," Proc. ACM Int'l Conf. Knowledge Discovery and Data Mining (SIGKDD), pp. 57-66, 2001. [8] A. Goyal, W. Lu, and L.V.S. Lakshmanan, "CELF++: Optimizing the Greedy Algorithm for Influence Maximization in Social Networks," Proc. Int'l Conf. World Wide Web (WWW), pp. 47-48, 2011. [9] P. Harish and P.J. Narayanan, "Accelerating Large Graph Algorithms on the GPU Using CUDA," Proc. High Performance Computing (HiPC), pp. 197-208, 2007. [10] Q. Jiang, G. Song, G. Cong, Y. Wang, W. Si, and K. Xie, "Simulated Annealing Based Influence Maximization in Social Networks," Proc. 25th AAAI Int'l Conf. Artificial Intelligence (AAAI), pp. 127-132, 2011. [11] K. Jung, W. Heo, and W. Chen, "IRIE: A Scalable Influence Maximization Algorithm for Independent Cascade Model and Its Extensions," CoRR arXiv rapid post arXiv:1111.4795, pp. 1-20, http://arxiv.org/abs1111.4795/, 2011. [12] D. Kempe, J. Kleinberg, and E. Tardos, "Maximizing the Spread of Influence through a Social Network," Proc. ACM Int'l Conf. Knowledge Discovery and Data Mining (SIGKDD), pp. 137-146, 2003. [13] H. Kwak, C. Lee, H. Park, and S. Moon, "What is Twitter, a Social Network or a News Media?" Proc. Int'l Conf. World Wide Web (WWW), pp. 591-600, 2010. [14] J. Leskovec, J. Kleinberg, and C. Faloutsos, "Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations," Proc. ACM Int'l Conf. Knowledge Discovery and Data Mining (SIGKDD), pp. 177-187, 2005. [15] J. Leskovec, L. Adamic, and B. Huberman, "The Dynamics of Viral Marketing," ACM Trans. Web, vol. 1, no. 1, p. 5, May 2007. [16] J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance, "Cost-effective Outbreak Detection in Networks," Proc. 13th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, 2007. [17] X. Liu, S. Li, X. Liao, L. Wang, and Q. Wu, "In-Time Estimation for Influence Maximization in Large-Scale Social Networks," Proc. ACM EuroSys Workshop Social Network Systems, pp. 1-6, 2012. [18] S.H. Nobari, X. Lu, P. Karras, and S. Bressan, "Fast Random Graph Generation," Proc. 14th Int'l Conf. Extending Database Technology (EDBT), pp. 331-342, 2011. [19] M. Richardson and P. Domingos, "Mining Knowledge-Sharing Sites for Viral Marketing," Proc. ACM Int'l Conf. Knowledge Discovery and Data Mining (SIGKDD), pp. 61-70, 2002. [20] V. Vineet, P. Harish, S. Patidar, and P.J. Narayanan, "Fast Minimum Spanning Tree for Large Graphs on the GPU," Proc. High Performance Graphics Conf. (HPG), pp. 167-171, 2010. [21] Y. Wang, G. Cong, G. Song, and K. Xie, "Community-Based Greedy Algorithm for Mining Top-K Influential Nodes in Mobile Social Networks," Proc. ACM Int'l Conf. Knowledge Discovery and Data Mining (SIGKDD), pp. 1039-1048, 2010. [22] R. Zafarani and H. Liu, "Social Computing Data Repository at ASU," http:/socialcomputing.asu.edu/, Nov. 2012.