[1] WASSERMAN S, FAUST K. Social Network Analysis:Methods and Applications[M]. New York:Cambridge University Press, 1994:148-161. [2] DOMINGOS P, RICHARDSON M. Mining the network value of customers[C]//KDD 2001:Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York:ACM, 2001:57-66. [3] KEMPE D, KLEINBERG J, TARDOS É. Maximizing the spread of influence through a social network[C]//KDD 2003:Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York:ACM, 2003:137-146. [4] LESKOVEC J, KRAUSE A, GUESTRIN C, et al. Cost-effective outbreak detection in networks[C]//KDD 2007:Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York:ACM, 2007:420-429. [5] CHEN W, WANG Y, YANG S. Efficient influence maximization in social networks[C]//KDD 2009:Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York:ACM, 2009:199-208. [6] 曹玖新,董丹,徐顺,等.一种基于k-核的社会网络影响最大化算法[J].计算机学报,2015,38(2):238-248. (CAO J X, DONG D, XU S, et al. A k-core based algorithm for influence maximization in social networks[J]. Chinese Journal of Computers, 2015, 38(2):238-248.) [7] WANG C, CHEN W, WANG Y. Scalable influence maximization for independent cascade model in large-scale social networks[J]. Data Mining & Knowledge Discovery, 2012, 25(3):545-576. [8] JUNG K, HEO W, CHEN W. IRIE:scalable and robust influence maximization in social networks[C]//ICDM 2012:Proceedings of the 2012 IEEE 12th International Conference on Data Mining. Washington, DC:IEEE Computer Society, 2012:918-923. [9] 夏涛,陈云芳,张伟,等.社会网络中的影响力综述[J].计算机应用,2014,34(4):980-985. (XIA T, CHEN Y F, ZHANG W, et al. Survey of influence in social networks[J]. Journal of Computer Applications, 2014, 34(4):980-985.) [10] 李国良,楚娅萍,冯建华,等.多社交网络的影响力最大化分析[J].计算机学报,2016,39(4):643-656. (LI G L, CHU Y P, FENG J H, et al. Influence maximization on multiple social networks[J]. Chinese Journal of Computers, 2016, 39(4):643-656.) [11] SEIDMAN S B. Network structure and minimum degree[J]. Social Networks, 1983, 5(3):269-287. [12] BATAGELJ V, ZAVERŠNIK M. An O(m) algorithm for cores decomposition of networks[J]. Computer Science, 2003, 1(6):34-37. [13] BRIN S, PAGE L. The anatomy of a large-scale hypertextual Web search engine[J]. Computer Networks and ISDN Systems, 1998, 30(1/2/3/4/5/6/7):107-117. [14] 刘院英,郭景峰,魏立东,等.成本控制下的快速影响最大化算法[J].计算机应用,2017,37(2):367-372. (LIU Y Y, GUO J F, WEI L D, et al. Fast influence maximization algorithm in social network under budget control[J]. Journal of Computer Applications, 2017, 37(2):367-372.) |