正在加载图片...
第6期 花勇，等：基于渗流模型的影响力最大化算法 ·1269· person experiment in social influence and political mobiliz- Polyhedral Combinatorics:Dedicated to the Memory of ation[J.Nature,2012,489(7415):295-298. D.R.Fulkerson.Berlin,Heidelberg:Springer,1978: [2]蒋庆丰，门朝光，田泽宇，等.社会感知的延迟容忍网络 73-87. 节点合作机制[.哈尔滨工程大学学报，2017,38(6)： [14]CORNUEJOLS G,FISHER ML,NEMHAUSER G L. 921-930 Location of bank accounts to optimize float:an analytic JIANG Qingfeng,MEN Chaoguang,TIAN Zeyu,et al.A study of exact and approximate algorithms[J].Manage- social-aware node cooperation mechanism for DTN[J]. ment science,.1977,23(8):789-810. Journal of Harbin Engineering University,2017,38(6): [15]WILLIAMS H P.Integer and combinatorial 921-930 optimization[J].Journal of the operational research soci- [3]LU Zaixin,FAN Lidan,WU Weili,et al.Efficient influ- ety,1990,41(2):177-178. ence spread estimation for influence maximization under [16]CHEN Wei,WANG Chi,WANG Yajun.Scalable influ- the linear threshold model[J].Computational social net- ence maximization for prevalent viral marketing in large- works,2014,1:2 scale social networks[Cl//Proceedings of the 16th ACM [4]MORONE F,MAKSE H A.Corrigendum:influence max- SIGKDD International Conference on Knowledge Dis- imization in complex networks through optimal percola- covery and Data Mining.Washington,USA,2010:1029- tion[J.Nature,2015,527(7579:544. 1038. [5]ZHU Zhiguo.Discovering the influential users oriented to [17]LEE J R,CHUNG C W.A fast approximation for influ- viral marketing based on online social networks[J].Phys- ence maximization in large social networks[Cl//Proceed- ica A:statistical mechanics and its applications,2013, ings of the 23rd International Conference on World Wide 392(16):3459-3469 Web.Seoul,Korea,2014:1157-1162. [6]SADOVYKH V,SUNDARAM D,PIRAMUTHU S.Do [18]JUNG K,HEO W.CHEN Wei.IRIE:scalable and robust online social networks support decision-making?[J].De- influence maximization in social networks[C]//Proceed- cision support systems,2015,70:15-30. ings of IEEE 12th International Conference on Data Min- [7]SCHMITT P,SKIERA B,VAN DEN BULTE C.Referral ing.Brussels,Belgium,2012:918-923. programs and customer value[J].Journal of marketing, [19]KITSAK M.GALLOS L K.HAVLIN S.et al.Identifica- 2011,75(1):46-59 tion of influential spreaders in complex networks[J] [8]VERBRAKEN T,GOETHALS F,VERBEKE W,et al. Nature physics,2010,6(11):888-893. Predicting online channel acceptance with social network [20]CARMI S,HAVLIN S,KIRKPATRICK S,et al.A mod- data[J].Decision support systems,2014,63:104-114. el of Internet topology using k-shell decomposition[J]. [9]GUILLE A.HACID H,FAVRE C,et al.Information dif- Proceedings of the national academy of sciences of the fusion in online social networks:a survey[J].ACM SIG- United States of America,2007,104(27):11150-11154. MOD record,2013,42(1)上17-28. [21]GAO Shuai,MA Jun,CHEN Zhumin,et al.Ranking the [10]GOLDENBERG J,LIBAI B,MULLER E.Talk of the spreading ability of nodes in complex networks based on network:a complex systems look at the underlying pro- local structure[J].Physica A:statistical mechanics and its cess of word-of-mouth[J].Marketing letters,2001,12(3): applications,.2014,403:130-147. 211-223 [22]王皓，高立群，欧阳海滨.多种群随机差分粒子群优化 [11]KEMPE D.KLEINBERG J,TARDOS E.Maximizing the 算法及其应用.哈尔滨工程大学学报，2017,38(4)： spread of influence through a social network[Cl//Proceed- 652-660. ings of the 9th ACM SIGKDD International Conference WANG Hao,GAO Liqun,OUYANG Haibin.Multi-pop- on Knowledge Discovery and Data Mining.Washington, ulation random differential particle swarm optimization USA,2003:137-146. and its application[J].Journal of Harbin Engineering Uni- [12]NEMHAUSER G L,WOLSEY L A,FISHER M L.An versity.,2017.38(4:652-660 analysis of approximations for maximizing submodular [23]刘畅，刘利强，张丽娜，等.改进萤火虫算法及其在全局 set functions-I[J].Mathematical programming,1978, 优化问题中的应用】.哈尔滨工程大学学报，2017， 14(1:265-294 38(4):569-577. [13]FISHER ML.NEMHAUSER G L.WOLSEY L A.An LIU CHANG,LIU Liqiang,ZHANG Lina,et al.An im- analysis of approximations for maximizing submodular proved firefly algorithm and its application in global op- set functions-II[M]//BALINSKI M L,HOFFMAN A J. timization[J].Journal of Harbin Engineering University,person experiment in social influence and political mobilization[J]. Nature, 2012, 489(7415): 295–298. 蒋庆丰, 门朝光, 田泽宇, 等. 社会感知的延迟容忍网络 节点合作机制 [J]. 哈尔滨工程大学学报, 2017, 38(6): 921–930. JIANG Qingfeng, MEN Chaoguang,TIAN Zeyu,et al. A social-aware node cooperation mechanism for DTN[J]. Journal of Harbin Engineering University, 2017, 38(6): 921–930. [2] LU Zaixin, FAN Lidan, WU Weili, et al. Efficient influence spread estimation for influence maximization under the linear threshold model[J]. Computational social networks, 2014, 1: 2. [3] MORONE F, MAKSE H A. Corrigendum: influence maximization in complex networks through optimal percolation[J]. Nature, 2015, 527(7579): 544. [4] ZHU Zhiguo. Discovering the influential users oriented to viral marketing based on online social networks[J]. Physica A: statistical mechanics and its applications, 2013, 392(16): 3459–3469. [5] SADOVYKH V, SUNDARAM D, PIRAMUTHU S. Do online social networks support decision-making?[J]. Decision support systems, 2015, 70: 15–30. [6] SCHMITT P, SKIERA B, VAN DEN BULTE C. Referral programs and customer value[J]. Journal of marketing, 2011, 75(1): 46–59. [7] VERBRAKEN T, GOETHALS F, VERBEKE W, et al. Predicting online channel acceptance with social network data[J]. Decision support systems, 2014, 63: 104–114. [8] GUILLE A, HACID H, FAVRE C, et al. Information diffusion in online social networks: a survey[J]. ACM SIGMOD record, 2013, 42(1): 17–28. [9] GOLDENBERG J, LIBAI B, MULLER E. Talk of the network: a complex systems look at the underlying process of word-of-mouth[J]. Marketing letters, 2001, 12(3): 211–223. [10] KEMPE D, KLEINBERG J, TARDOS É. Maximizing the spread of influence through a social network[C]//Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Washington, USA, 2003: 137–146. [11] NEMHAUSER G L, WOLSEY L A, FISHER M L. An analysis of approximations for maximizing submodular set functions-I[J]. Mathematical programming, 1978, 14(1): 265–294. [12] FISHER M L, NEMHAUSER G L, WOLSEY L A. An analysis of approximations for maximizing submodular set functions-II[M]//BALINSKI M L, HOFFMAN A J. [13] Polyhedral Combinatorics: Dedicated to the Memory of D. R. Fulkerson. Berlin, Heidelberg: Springer, 1978: 73–87. CORNUEJOLS G, FISHER M L, NEMHAUSER G L. Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms[J]. Management science, 1977, 23(8): 789–810. [14] WILLIAMS H P. Integer and combinatorial optimization[J]. Journal of the operational research society, 1990, 41(2): 177–178. [15] CHEN Wei, WANG Chi, WANG Yajun. Scalable influence maximization for prevalent viral marketing in largescale social networks[C]//Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Washington, USA, 2010: 1029- 1038. [16] LEE J R, CHUNG C W. A fast approximation for influence maximization in large social networks[C]//Proceedings of the 23rd International Conference on World Wide Web. Seoul, Korea, 2014: 1157–1162. [17] JUNG K, HEO W, CHEN Wei. IRIE: scalable and robust influence maximization in social networks[C]//Proceedings of IEEE 12th International Conference on Data Mining. Brussels, Belgium, 2012: 918–923. [18] KITSAK M, GALLOS L K, HAVLIN S, et al. Identification of influential spreaders in complex networks[J]. Nature physics, 2010, 6(11): 888–893. [19] CARMI S, HAVLIN S, KIRKPATRICK S, et al. A model of Internet topology using k-shell decomposition[J]. Proceedings of the national academy of sciences of the United States of America, 2007, 104(27): 11150–11154. [20] GAO Shuai, MA Jun, CHEN Zhumin, et al. Ranking the spreading ability of nodes in complex networks based on local structure[J]. Physica A: statistical mechanics and its applications, 2014, 403: 130–147. [21] 王皓, 高立群, 欧阳海滨. 多种群随机差分粒子群优化 算法及其应用 [J]. 哈尔滨工程大学学报, 2017, 38(4): 652–660. WANG Hao, GAO Liqun, OUYANG Haibin. Multi-population random differential particle swarm optimization and its application[J]. Journal of Harbin Engineering University, 2017, 38(4): 652–660. [22] 刘畅, 刘利强, 张丽娜, 等. 改进萤火虫算法及其在全局 优化问题中的应用 [J]. 哈尔滨工程大学学报, 2017, 38(4): 569–577. LIU CHANG, LIU Liqiang, ZHANG Lina, et al. An improved firefly algorithm and its application in global optimization[J]. Journal of Harbin Engineering University, [23] 第 6 期 花勇，等：基于渗流模型的影响力最大化算法 ·1269·