{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:25:43Z","timestamp":1740176743891,"version":"3.37.3"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,11,7]],"date-time":"2018-11-07T00:00:00Z","timestamp":1541548800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s41060-018-0155-5","type":"journal-article","created":{"date-parts":[[2018,11,7]],"date-time":"2018-11-07T00:14:09Z","timestamp":1541549649000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Stochastic dynamic programming heuristics for influence maximization\u2013revenue optimization"],"prefix":"10.1007","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5143-2231","authenticated-orcid":false,"given":"Trisha","family":"Lawrence","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1729-559X","authenticated-orcid":false,"given":"Patrick","family":"Hosein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,7]]},"reference":[{"key":"155_CR1","doi-asserted-by":"publisher","unstructured":"Abbassi, Z., Bhaskara, A., Misra, V.: Optimizing display advertising in online social networks. In: Proceedings of the 24th International Conference on World Wide Web, International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, Switzerland, WWW \u201915, pp. 1\u201311, (2015). \n                    https:\/\/doi.org\/10.1145\/2736277.2741648","DOI":"10.1145\/2736277.2741648"},{"key":"155_CR2","volume-title":"Dynamic Programming","author":"R Bellman","year":"1957","unstructured":"Bellman, R.: Dynamic Programming. Princeton University Press, Princeton, NJ (1957)"},{"issue":"3","key":"155_CR3","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1287\/moor.16.3.580","volume":"16","author":"DP Bertsekas","year":"1991","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: An analysis of stochastic shortest path problems. Math. Oper. Res. 16(3), 580\u2013595 (1991). \n                    https:\/\/doi.org\/10.1287\/moor.16.3.580","journal-title":"Math. Oper. Res."},{"key":"155_CR4","doi-asserted-by":"publisher","unstructured":"Bhagat, S., Goyal, A., Lakshmanan, LV.: Maximizing product adoption in social networks. In: Proceedings of the Fifth ACM International Conference on Web Search and Data Mining, ACM, New York, NY, USA, WSDM \u201912, pp. 603\u2013612, (2012). \n                    https:\/\/doi.org\/10.1145\/2124295.2124368","DOI":"10.1145\/2124295.2124368"},{"key":"155_CR5","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-23780-5_28","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"T Cao","year":"2011","unstructured":"Cao, T., Wu, X., Hu, T.X., Wang, S.: Active learning of model parameters for influence maximization. In: Gunopulos, D., Hofmann, T., Malerba, D., Vazirgiannis, M. (eds.) Machine Learning and Knowledge Discovery in Databases, pp. 280\u2013295. Springer, Berlin (2011)"},{"key":"155_CR6","doi-asserted-by":"publisher","unstructured":"Chakrabarti, S., Dom, B., Indyk, P.: Enhanced hypertext categorization using hyperlinks. In: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, ACM, New York, NY, USA, SIGMOD \u201998, pp. 307\u2013318, (1998).\n                    https:\/\/doi.org\/10.1145\/276304.276332","DOI":"10.1145\/276304.276332"},{"key":"155_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11633-018-1124-0","volume":"15","author":"B Chang","year":"2018","unstructured":"Chang, B., Xu, T., Liu, Q., Chen, E.H.: Study on information diffusion analysis in social networks and its applications. Int. J. Autom. Comput. 15, 1\u201326 (2018)","journal-title":"Int. J. Autom. Comput."},{"key":"155_CR8","doi-asserted-by":"publisher","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, New York, NY, USA, KDD \u201909, pp. 199\u2013208, (2009). \n                    https:\/\/doi.org\/10.1145\/1557019.1557047","DOI":"10.1145\/1557019.1557047"},{"key":"155_CR9","doi-asserted-by":"publisher","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, New York, NY, USA, KDD \u201910, pp 1029\u20131038, (2010). \n                    https:\/\/doi.org\/10.1145\/1835804.1835934","DOI":"10.1145\/1835804.1835934"},{"key":"155_CR10","doi-asserted-by":"crossref","unstructured":"Chen, W., Collins, A., Cummings, R., Ke, T., Liu, Z., Rincon, D., Sun, X., Wei, W., Wang, Y., Yuan, Y.: Influence maximization in social networks when negative opinions may emerge and propagate. In: Proceedings of the 2011 SIAM International Conference on Data Mining (SDM\u20192011) (2011)","DOI":"10.1137\/1.9781611972818.33"},{"key":"155_CR11","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-39930-8_8","volume-title":"Discrete Particle Swarm Optimization, Illustrated by the Traveling Salesman Problem","author":"M Clerc","year":"2004","unstructured":"Clerc, M.: Discrete Particle Swarm Optimization, Illustrated by the Traveling Salesman Problem, pp. 219\u2013239. Springer, Berlin (2004). \n                    https:\/\/doi.org\/10.1007\/978-3-540-39930-8_8"},{"key":"155_CR12","first-page":"18","volume":"1991","author":"L Davis","year":"1991","unstructured":"Davis, L.: Bit-climbing, representational bias, and test suit design. Proc. Int. Conf. Genetic Algorithm 1991, 18\u201323 (1991)","journal-title":"Proc. Int. Conf. Genetic Algorithm"},{"key":"155_CR13","doi-asserted-by":"publisher","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, New York, NY, USA, KDD \u201901, pp 57\u201366, (2001). \n                    https:\/\/doi.org\/10.1145\/502512.502525","DOI":"10.1145\/502512.502525"},{"key":"155_CR14","doi-asserted-by":"publisher","unstructured":"Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Symposium on Micro Machine and Human Science. Japan, Nagoya, Piscataway, NJ, pp. 39\u201343 (1995). \n                    https:\/\/doi.org\/10.1109\/MHS.1995.494215","DOI":"10.1109\/MHS.1995.494215"},{"key":"155_CR15","volume-title":"Swarm Intelligence","author":"RC Eberhart","year":"2001","unstructured":"Eberhart, R.C., Shi, Y., Kennedy, J.: Swarm Intelligence. Morgan Kaufmann Publishers, San Francisco, Amsterdam (2001)"},{"key":"155_CR16","unstructured":"Facebook (2016) Facebook reports fourth quarter and full year 2016 results. \n                    https:\/\/investor.fb.com\/investor-news\/press-release-details\/2017\/facebook-Reports-Full-Year-2016\n                    \n                   (2016). Accessed 3 Jan 2017"},{"key":"155_CR17","doi-asserted-by":"publisher","unstructured":"Galhotra, S., Arora, A., Roy, S.: Holistic influence maximization: Combining scalability and efficiency with opinion-aware models. In: Proceedings of the 2016 International Conference on Management of Data, ACM, New York, NY, USA, SIGMOD \u201916, pp. 743\u2013758, (2016). \n                    https:\/\/doi.org\/10.1145\/2882903.2882929","DOI":"10.1145\/2882903.2882929"},{"issue":"5 Pt 2","key":"155_CR18","first-page":"056","volume":"79","author":"A Galstyan","year":"2009","unstructured":"Galstyan, A., Musoyan, V.L., Cohen, P.R.: Maximizing influence propagation in networks with community structure. Phys. Rev. E Stat Nonlinearv Soft Matter Phys. 79(5 Pt 2), 056\u2013102 (2009)","journal-title":"Phys. Rev. E Stat Nonlinearv Soft Matter Phys."},{"issue":"6","key":"155_CR19","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","volume":"6","author":"S Geman","year":"1984","unstructured":"Geman, S., Geman, D.: Stochastic relaxation, gibbs distributions, and the bayesian restoration of images. IEEE Trans. Pattern Anal. Mac.h Intell. 6(6), 721\u2013741 (1984). \n                    https:\/\/doi.org\/10.1109\/TPAMI.1984.4767596","journal-title":"IEEE Trans. Pattern Anal. Mac.h Intell."},{"key":"155_CR20","doi-asserted-by":"publisher","unstructured":"Gomez\u00a0Rodriguez, M., Leskovec, J., Krause, A.: Inferring networks of diffusion and influence. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, New York, NY, USA, KDD \u201910, pp. 1019\u20131028, (2010). \n                    https:\/\/doi.org\/10.1145\/1835804.1835933","DOI":"10.1145\/1835804.1835933"},{"key":"155_CR21","doi-asserted-by":"publisher","unstructured":"Goyal, A., Bonchi, F., Lakshmanan, LV.: Learning influence probabilities in social networks. In: Proceedings of the Third ACM International Conference on Web Search and Data Mining, ACM, New York, NY, USA, WSDM \u201910, pp. 241\u2013250, (2010). \n                    https:\/\/doi.org\/10.1145\/1718487.1718518","DOI":"10.1145\/1718487.1718518"},{"issue":"6","key":"155_CR22","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1086\/226707","volume":"83","author":"M Granovetter","year":"1978","unstructured":"Granovetter, M.: Threshold models of collective behavior. Am. J. Sociol. 83(6), 1420\u20131443 (1978). \n                    https:\/\/doi.org\/10.1086\/226707","journal-title":"Am. J. Sociol."},{"key":"155_CR23","doi-asserted-by":"publisher","unstructured":"Han, K., Xu, C., Gui, F., Tang, S., Huang, H., Luo, J.: Discount allocation for revenue maximization in online social networks. In: Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, ACM, New York, NY, USA, Mobihoc \u201918, pp. 121\u2013130, (2018). \n                    https:\/\/doi.org\/10.1145\/3209582.3209595","DOI":"10.1145\/3209582.3209595"},{"key":"155_CR24","doi-asserted-by":"publisher","unstructured":"He, X., Kempe, D.: Stability of influence maximization. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, New York, NY, USA, KDD \u201914, pp. 1256\u20131265, (2014). \n                    https:\/\/doi.org\/10.1145\/2623330.2623746","DOI":"10.1145\/2623330.2623746"},{"key":"155_CR25","doi-asserted-by":"crossref","unstructured":"Hosein, P., Lawrence, T.: Stochastic dynamic programming model for revenue optimization in social networks. 2015 IEEE 11th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob) pp. 378\u2013383 (2015)","DOI":"10.1109\/WiMOB.2015.7347987"},{"issue":"1","key":"155_CR26","doi-asserted-by":"publisher","first-page":"199","DOI":"10.3233\/IDA-150801","volume":"20","author":"M Hosseini-Pozveh","year":"2016","unstructured":"Hosseini-Pozveh, M., Zamanifar, K., Naghsh-Nilchi, A.R., Dolog, P.: Maximizing the spread of positive influence in signed social networks. Intell. Data Anal. 20(1), 199\u2013218 (2016)","journal-title":"Intell. Data Anal."},{"key":"155_CR27","doi-asserted-by":"publisher","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, New York, NY, USA, KDD \u201903, pp. 137\u2013146, (2003). \n                    https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"155_CR28","unstructured":"Kennedy, J., Eberhart, RC.: A discrete binary version of the particle swarm algorithm. In: Proceedings of Conference on System, Man and Cybernetics (1997)"},{"key":"155_CR29","unstructured":"Kimura, M., Saito, K., Motoda, H.: Minimizing the spread of contamination by blocking links in a network. In: Proceedings of the 23rd National Conference on Artificial Intelligence , Vol. 2, AAAI Press, AAAI\u201908, pp 1175\u20131180, (2008). \n                    http:\/\/dl.acm.org\/citation.cfm?id=1620163.1620255"},{"issue":"1","key":"155_CR30","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s41060-015-0001-y","volume":"1","author":"M Kimura","year":"2016","unstructured":"Kimura, M., Saito, K., Ohara, K., Motoda, H.: Speeding-up node influence computation for huge social networks. Int. J. Data Sci. Anal. 1(1), 3\u201316 (2016). \n                    https:\/\/doi.org\/10.1007\/s41060-015-0001-y","journal-title":"Int. J. Data Sci. Anal."},{"key":"155_CR31","doi-asserted-by":"publisher","unstructured":"Kossinets, G., Kleinberg, J., Watts, D.: The structure of information pathways in a social communication network. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, New York, NY, USA, KDD \u201908, pp. 435\u2013443, (2008). \n                    https:\/\/doi.org\/10.1145\/1401890.1401945","DOI":"10.1145\/1401890.1401945"},{"key":"155_CR32","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection. \n                    http:\/\/snap.stanford.edu\/data\n                    \n                   (2014). Accessed 29 Feb 2017"},{"key":"155_CR33","doi-asserted-by":"publisher","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, New York, NY, USA, KDD \u201907, pp. 420\u2013429, (2007). \n                    https:\/\/doi.org\/10.1145\/1281192.1281239","DOI":"10.1145\/1281192.1281239"},{"key":"155_CR34","doi-asserted-by":"crossref","unstructured":"Liu, B., Cong, G., Xu, D., Zeng, Y.: Time constrained influence maximization in social networks. In: 2012 IEEE 12th International Conference on Data Mining (ICDM), IEEE, pp. 439\u2013448 (2012)","DOI":"10.1109\/ICDM.2012.158"},{"issue":"1","key":"155_CR35","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s41060-017-0082-x","volume":"5","author":"G Loukides","year":"2018","unstructured":"Loukides, G., Gwadera, R.: Preventing the diffusion of information to vulnerable users while preserving pagerank. Int. J. Data Sci. Anal. 5(1), 19\u201339 (2018). \n                    https:\/\/doi.org\/10.1007\/s41060-017-0082-x","journal-title":"Int. J. Data Sci. Anal."},{"issue":"1","key":"155_CR36","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M Matsumoto","year":"1998","unstructured":"Matsumoto, M., Nishimura, T.: Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model Comput. Simul. 8(1), 3\u201330 (1998). \n                    https:\/\/doi.org\/10.1145\/272991.272995","journal-title":"ACM Trans. Model Comput. Simul."},{"key":"155_CR37","unstructured":"Meerman, S.: Viral marketing: Let the world tell your story for free. \n                    https:\/\/www.pragmaticmarketing.com\/resources\/articles\/Viral-Marketing-Let-The-World-Tell-Your-Story\n                    \n                   (2008). Accessed 10 Oct 2017"},{"issue":"7563","key":"155_CR38","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1038\/nature14604","volume":"524","author":"F Morone","year":"2015","unstructured":"Morone, F., Makse, H.A.: Influence maximization in complex networks through optimal percolation. Nature 524(7563), 65 (2015)","journal-title":"Nature"},{"issue":"12","key":"155_CR39","doi-asserted-by":"publisher","first-page":"2995","DOI":"10.1109\/TAC.2013.2272973","volume":"58","author":"J Nascimento","year":"2013","unstructured":"Nascimento, J., Powell, W.B.: An optimal approximate dynamic programming algorithm for concave, scalar storage problems with vector-valued controls. IEEE Trans. Autom. Control 58(12), 2995\u20133010 (2013)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"155_CR40","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions\u2013I. Math. Progr. 14(1), 265\u2013294 (1978). \n                    https:\/\/doi.org\/10.1007\/BF01588971","journal-title":"Math. Progr."},{"key":"155_CR41","doi-asserted-by":"publisher","DOI":"10.1002\/9780470182963","volume-title":"Approximate Dynamic Programming: Solving the Curses of dimensionality","author":"WB Powell","year":"2007","unstructured":"Powell, W.B.: Approximate Dynamic Programming: Solving the Curses of dimensionality, vol. 703. Wiley, London (2007)"},{"key":"155_CR42","doi-asserted-by":"publisher","unstructured":"Pramanik, S., Sharma, M., Danisch, M., Wang, Q., Guillaume, JL., Bivas, M.: Easy-mention: a model-driven mention recommendation heuristic to boost your tweet popularity. Int. J. Data Sci. Anal. 5:1\u201317, (2018). \n                    https:\/\/doi.org\/10.1007\/s41060-018-0121-2","DOI":"10.1007\/s41060-018-0121-2"},{"key":"155_CR43","first-page":"65","volume-title":"On the Problem of Multi-Staged Impression Allocation in Online Social Networks","author":"I Rahaman","year":"2018","unstructured":"Rahaman, I., Hosein, P.: On the Problem of Multi-Staged Impression Allocation in Online Social Networks, pp. 65\u201384. Springer, Cham (2018)"},{"key":"155_CR44","doi-asserted-by":"publisher","unstructured":"Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, New York, NY, USA, KDD \u201902, pp. 61\u201370, (2002).\n                    https:\/\/doi.org\/10.1145\/775047.775057","DOI":"10.1145\/775047.775057"},{"issue":"1","key":"155_CR45","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s41060-017-0082-x","volume":"5","author":"G Rossetti","year":"2018","unstructured":"Rossetti, G., Milli, L., Salvatore, R., S\u00eerbu, A., Pedreschi, D., Giannotti, F.: Ndlib: a python library to model and analyze diffusion processes over complex networks. Int. J. Data Sci. Anal. 5(1), 61\u201379 (2018). \n                    https:\/\/doi.org\/10.1007\/s41060-017-0082-x","journal-title":"Int. J. Data Sci. Anal."},{"key":"155_CR46","doi-asserted-by":"publisher","unstructured":"Saito, K., Nakano, R., Kimura, M.: Prediction of information diffusion probabilities for independent cascade model. In: Proceedings of the 12th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III, Springer-Verlag, Berlin, Heidelberg, KES \u201908, pp. 67\u201375, (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-85567-5_9","DOI":"10.1007\/978-3-540-85567-5_9"},{"issue":"8","key":"155_CR47","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0141-9331(02)00053-4","volume":"26","author":"A Salman","year":"2002","unstructured":"Salman, A., Ahmad, I., Al-Madani, S.: Particle swarm optimization for task assignment problem. Microprocess. Microsyst. 26(8), 363\u2013371 (2002)","journal-title":"Microprocess. Microsyst."},{"issue":"4","key":"155_CR48","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.cie.2006.09.002","volume":"51","author":"D Sha","year":"2006","unstructured":"Sha, D., Hsu, C.Y.: A hybrid particle swarm optimization for job shop scheduling problem. Comput. Ind. Eng. 51(4), 791\u2013808 (2006)","journal-title":"Comput. Ind. Eng."},{"key":"155_CR49","doi-asserted-by":"crossref","unstructured":"Singer, Y.: How to win friends and influence people, truthfully: influence maximization mechanisms for social networks. In: Proceedings of the fifth ACM international conference on Web search and data mining, ACM, pp. 733\u2013742 (2012)","DOI":"10.1145\/2124295.2124381"},{"key":"155_CR50","doi-asserted-by":"crossref","unstructured":"Song, Y., Dinh, T.: Optimal containment of misinformation in social media: A scenario-based approach. In: Combinatorial Optimization and Applications. COCOA 2014. Lecture Notes in Computer Science, Springer, pp. 547\u2013556 (2014)","DOI":"10.1007\/978-3-319-12691-3_40"},{"key":"155_CR51","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-3-319-91452-7_32","volume-title":"Database Systems for Advanced Applications","author":"H Sun","year":"2018","unstructured":"Sun, H., Cheng, R., Xiao, X., Yan, J., Zheng, Y., Qian, Y.: Maximizing social influence for the awareness threshold model. In: Pei, J., Manolopoulos, Y., Sadiq, S., Li, J. (eds.) Database Systems for Advanced Applications, pp. 491\u2013510. Springer, Cham (2018)"},{"issue":"3","key":"155_CR52","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0167-6377(96)00042-9","volume":"20","author":"E Tsang","year":"1997","unstructured":"Tsang, E., Voudouris, C.: Fast local search and guided local search and their application to british telecom\u2019s workforce scheduling problem. Oper. Res. Lett. 20(3), 119\u2013127 (1997). \n                    https:\/\/doi.org\/10.1016\/S0167-6377(96)00042-9","journal-title":"Oper. Res. Lett."},{"key":"155_CR53","unstructured":"Wang, K.P., Huang, L., Zhou, C.G., Pang, W.: Particle swarm optimization for traveling salesman problem. In: International Conference Machine Learning Cybernetics, IEEE, vol. 3, pp. 1583\u20131585 (2003)"},{"key":"155_CR54","doi-asserted-by":"publisher","unstructured":"Wang, Y., Cong, G., Song, G., Xie, K.: Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, New York, NY, USA, KDD \u201910, pp. 1039\u20131048, (2010). \n                    https:\/\/doi.org\/10.1145\/1835804.1835935","DOI":"10.1145\/1835804.1835935"},{"key":"155_CR55","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-319-93040-4_55","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"YT Wen","year":"2018","unstructured":"Wen, Y.T., Peng, W.C., Shuai, H.H.: Maximizing social influence on target users. In: Phung, D., Tseng, V.S., Webb, G.I., Ho, B., Ganji, M., Rashidi, L. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 701\u2013712. Springer, Cham (2018)"},{"issue":"3","key":"155_CR56","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10589-017-9958-x","volume":"69","author":"HH Wu","year":"2018","unstructured":"Wu, H.H., K\u00fc\u00e7\u00fckyavuz, S.: A two-stage stochastic programming approach for influence maximization in social networks. Comput. Optim. Appl. 69(3), 563\u2013595 (2018). \n                    https:\/\/doi.org\/10.1007\/s10589-017-9958-x","journal-title":"Comput. Optim. Appl."},{"key":"155_CR57","doi-asserted-by":"publisher","first-page":"2320","DOI":"10.1109\/ACCESS.2017.2782814","volume":"6","author":"J Yang","year":"2018","unstructured":"Yang, J., Liu, J.: Influence maximization-cost minimization in social networks based on a multiobjective discrete particle swarm optimization algorithm. IEEE Access 6, 2320\u20132329 (2018)","journal-title":"IEEE Access"},{"key":"155_CR58","unstructured":"Zafarani, R., Liu, H.: Social computing data repository at ASU. (2009). \n                    http:\/\/socialcomputing.asu.edu\n                    \n                  . Accessed 29 Feb 2017"},{"key":"155_CR59","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-319-92013-9_20","volume-title":"Databases Theory and Applications","author":"Y Zhang","year":"2018","unstructured":"Zhang, Y., Zhang, P., Bao, Z., Xie, Z., Liu, Q., Zhang, B.: Finding influential nodes by a fast marginal ranking method. In: Wang, J., Cong, G., Chen, J., Qi, J. (eds.) Databases Theory and Applications, pp. 249\u2013261. Springer, Cham (2018)"}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-018-0155-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41060-018-0155-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-018-0155-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T19:25:09Z","timestamp":1573068309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41060-018-0155-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,7]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["155"],"URL":"https:\/\/doi.org\/10.1007\/s41060-018-0155-5","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"type":"print","value":"2364-415X"},{"type":"electronic","value":"2364-4168"}],"subject":[],"published":{"date-parts":[[2018,11,7]]},"assertion":[{"value":"14 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}