{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:18:01Z","timestamp":1761621481438},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Nature Science Foundation of China","award":["61502281"],"award-info":[{"award-number":["61502281"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s00500-019-04483-5","type":"journal-article","created":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T14:03:41Z","timestamp":1572617021000},"page":"5921-5931","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Scalable influence maximization based on influential seed successors"],"prefix":"10.1007","volume":"24","author":[{"given":"Sun","family":"Chengai","sequence":"first","affiliation":[]},{"given":"Niu","family":"Weinan","sequence":"additional","affiliation":[]},{"given":"Qiu","family":"Liqing","sequence":"additional","affiliation":[]},{"given":"Lv","family":"Liangyu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,1]]},"reference":[{"issue":"2","key":"4483_CR1","first-page":"28","volume":"9","author":"FH Abdulfattah","year":"2019","unstructured":"Abdulfattah FH (2019) Factors affecting students\u2019 intention toward mobile cloud computing: mobile cloud computing. Int J Cloud Appl Comput 9(2):28\u201342","journal-title":"Int J Cloud Appl Comput"},{"issue":"7-8","key":"4483_CR2","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1080\/01969722.2018.1542854","volume":"49","author":"N Arora","year":"2018","unstructured":"Arora N, Banati H (2018) IM-GSO: a community directed group search optimization approach for influence maximization. Cybern Syst 49(7-8):497\u2013520","journal-title":"Cybern Syst"},{"issue":"3","key":"4483_CR3","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1142\/S0218488518500198","volume":"26","author":"E Bagheri","year":"2018","unstructured":"Bagheri E, Dastghaibyfard G, Hamzeh A (2018) FSIM: a fast and scalable influence maximization algorithm based on community detection. Int J Uncertain Fuzz Knowl Based Syst 26(3):379\u2013396","journal-title":"Int J Uncertain Fuzz Knowl Based Syst"},{"issue":"6","key":"4483_CR4","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1016\/j.ipm.2016.05.006","volume":"52","author":"A Bozorgi","year":"2016","unstructured":"Bozorgi A, Haghighi H, Zahedi MS et al (2016) INCIM: a community-based algorithm for influence maximization problem under the linear threshold model. Inf Process Manag 52(6):1188\u20131199","journal-title":"Inf Process Manag"},{"key":"4483_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.knosys.2017.07.029","volume":"134","author":"A Bozorgi","year":"2017","unstructured":"Bozorgi A, Samet S, Kwisthout J et al (2017) Community-based influence maximization in social networks under a competitive linear threshold model. Knowl Based Syst 134:149\u2013158","journal-title":"Knowl Based Syst"},{"issue":"2","key":"4483_CR6","first-page":"1","volume":"38","author":"JX Cao","year":"2015","unstructured":"Cao JX, Dong D, Xu S et al (2015) A k-core based algorithm for influence maximization in social networks. Chin J Comput 38(2):1\u20137","journal-title":"Chin J Comput"},{"key":"4483_CR7","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining, New York, NY, USA, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"4483_CR8","unstructured":"Chen W, Yuan Y, Zhang L (2011) Scalable influence maximization in social networks under the linear threshold model. In: Proceedings of the international conference on data mining. IEEE, Sydney, Australia, pp 88\u201397"},{"issue":"4","key":"4483_CR9","doi-asserted-by":"publisher","first-page":"1777","DOI":"10.1016\/j.physa.2011.09.017","volume":"391","author":"D Chen","year":"2012","unstructured":"Chen D, Linyuan L, Shang M-S, Zhang Y-C, Zhou T (2012) Identifying influential nodes in complex networks. Phys A 391(4):1777\u20131787","journal-title":"Phys A"},{"issue":"2","key":"4483_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2532549","volume":"5","author":"YC Chen","year":"2014","unstructured":"Chen YC, Zhu WY, Peng WC et al (2014) CIM: community-based influence maximization in social networks. ACM Trans Intell Syst Technol 5(2):1\u201331","journal-title":"ACM Trans Intell Syst Technol"},{"key":"4483_CR11","doi-asserted-by":"crossref","unstructured":"Cheng S, Shen H, Huang J et al (2014) IMRank: influence maximization via finding self-consistent ranking, pp 475\u2013484","DOI":"10.1145\/2600428.2609592"},{"key":"4483_CR12","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the KDD, New York, NY, USA, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"issue":"2014","key":"4483_CR13","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.physa.2014.02.032","volume":"403","author":"S Gao","year":"2014","unstructured":"Gao S, Ma J, Chen Z, Wang G, Xing C (2014) Ranking the spreading capability of nodes in complex networks based on local structure. Phys A 403(2014):130\u2013147","journal-title":"Phys A"},{"key":"4483_CR14","doi-asserted-by":"crossref","unstructured":"Gao Y, Wang X, Wang L (2017) A platform for reshaping organizational networks. In: Proceedings of China control conference, Dalian, China, pp 11278\u201311283","DOI":"10.23919\/ChiCC.2017.8029156"},{"issue":"5","key":"4483_CR15","first-page":"1","volume":"49","author":"H Huang","year":"2019","unstructured":"Huang H, Shen H, Meng Z et al (2019) Community-based influence maximization for viral marketing. Appl Intell 49(5):1\u201314","journal-title":"Appl Intell"},{"key":"4483_CR16","doi-asserted-by":"crossref","unstructured":"Jiang Q, Song G, Cong G et al (2011) Simulated annealing based influence maximization in social networks. In: Proceedings of the twenty-fifth AAAI conference on artificial intelligence, AAAI, San Francisco, CA, USA, pp 127\u2013132","DOI":"10.1609\/aaai.v25i1.7838"},{"key":"4483_CR17","doi-asserted-by":"crossref","unstructured":"Jung K, Heo W, Chen W (2013) IRIE: scalable and robust influence maximization in social networks. In: Proceedings of the IEEE international conference on data mining. IEEE, Washington, DC, USA","DOI":"10.1109\/ICDM.2012.79"},{"key":"4483_CR18","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J (2003) Maximizing the spread of influence through a social network. In: Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining, New York, NY, USA, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"issue":"11","key":"4483_CR19","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak M, Gallos LK, Havlin S, Liljeros F, Muchnik L, Stanley HE, Makse HA (2010) Identification of influential spreaders in complex networks. Nat Phys 6(11):888\u2013893","journal-title":"Nat Phys"},{"key":"4483_CR20","doi-asserted-by":"crossref","unstructured":"Leskovec J et al (2007) Cost-effective outbreak detection in networks. In: Proceedings of KDD, New York, NY, USA, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"4483_CR21","unstructured":"Li CT, Hsieh HP, Lin SD, Shan MK (2012) Finding influential seed successors in social networks. In: Proceedings of the 21st international conference on world wide web. ACM, New York, NY, USA, pp 557\u2013558"},{"issue":"2018","key":"4483_CR22","first-page":"88","volume":"275","author":"X Li","year":"2018","unstructured":"Li X, Cheng X, Su S et al (2018) Community-based seeds selection algorithm for location-aware influence maximization. Neurocomputing 275(2018):88\u2013100","journal-title":"Neurocomputing"},{"key":"4483_CR23","doi-asserted-by":"crossref","unstructured":"Liu Q, Xiang B, Chen E et al (2014) Influence maximization over large-scale social networks: a bounded linear approach. In: Proceedings of the KDD, Shang Hai, China, pp 171\u2013180","DOI":"10.1145\/2661829.2662009"},{"issue":"7","key":"4483_CR24","first-page":"179","volume":"18","author":"YY Liu","year":"2018","unstructured":"Liu YY, Guo JF, Jiang JW (2018) A hybrid algorithm for influence maximization. Sci Technol Eng 18(7):179\u2013184","journal-title":"Sci Technol Eng"},{"issue":"2004","key":"4483_CR25","first-page":"1087","volume":"21","author":"N Metropolis","year":"2004","unstructured":"Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller E (2004) Equation of state calculations by fast computing machines. J Chem Phys 21(2004):1087\u20131092","journal-title":"J Chem Phys"},{"issue":"4","key":"4483_CR26","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1007\/s11277-016-3939-8","volume":"93","author":"DL Nguyen","year":"2017","unstructured":"Nguyen DL, Nguyen TH, Do TH (2017) Probability-based multi-hop diffusion method for influence maximization in social networks. Wirel Person Commun 93(4):903\u2013916","journal-title":"Wirel Person Commun"},{"key":"4483_CR27","first-page":"1296","volume-title":"Fast influence-based coarsening for large networks","author":"M Purohit","year":"2014","unstructured":"Purohit M, Prakash BA, Kang C et al (2014) Fast influence-based coarsening for large networks. ACM, New York, pp 1296\u20131305"},{"key":"4483_CR28","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the KDD, New York, NY, USA, pp 61\u201370","DOI":"10.1145\/775047.775057"},{"issue":"1","key":"4483_CR29","first-page":"33","volume":"9","author":"K Sambrekar","year":"2019","unstructured":"Sambrekar K (2019) Fast and efficient multiview access control mechanism for cloud based agriculture storage management system. Int J Cloud Appl Comput 9(1):33\u201349","journal-title":"Int J Cloud Appl Comput"},{"key":"4483_CR30","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2016.09.029","volume":"117","author":"J Shang","year":"2016","unstructured":"Shang J, Zhou S, Li X et al (2016) CoFIM: a community-based framework for influence maximization on large-scale networks. Knowl Based Syst 117:88\u2013100","journal-title":"Knowl Based Syst"},{"issue":"15","key":"4483_CR31","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1016\/j.physa.2018.08.045","volume":"512","author":"J Shang","year":"2018","unstructured":"Shang J, Wu H, Zhou S, Zhong J, Feng Y, Qiang B (2018) IMPC: influence maximization based on multi-neighbor potential in community networks. Phys A Stat Mech Appl 512(15):1085\u20131103","journal-title":"Phys A Stat Mech Appl"},{"issue":"1","key":"4483_CR32","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s13278-018-0489-y","volume":"8","author":"J Tang","year":"2018","unstructured":"Tang J, Tang X, Yuan J (2018) An efficient and effective hop-based approach for influence maximization in social networks. Soc Netw Anal Min 8(1):10","journal-title":"Soc Netw Anal Min"},{"key":"4483_CR33","doi-asserted-by":"crossref","unstructured":"Wang Y (2010) Community-based greedy algorithm for mining top-K influential nodes in mobile social networks. In: ACM Sigkdd international conference on knowledge discovery & data mining. ACM, Washington, DC, USA, pp 1039\u20131048","DOI":"10.1145\/1835804.1835935"},{"issue":"5","key":"4483_CR34","first-page":"145","volume":"41","author":"S Wang","year":"2015","unstructured":"Wang S, Li B, Liu X et al (2015) An influence maximization algorithm of boundary nodes based on the degree of community. Appl Electron Tech 41(5):145\u2013148","journal-title":"Appl Electron Tech"},{"issue":"2","key":"4483_CR35","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1109\/TKDE.2016.2624734","volume":"29","author":"X Wang","year":"2017","unstructured":"Wang X, Zhang Y, Zhang W et al (2017) Bring order into the samples: a novel scalable method for influence maximization. IEEE Trans Knowl Data Eng 29(2):243\u2013256","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04483-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-04483-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04483-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T07:26:41Z","timestamp":1664782001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-04483-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,1]]},"references-count":35,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["4483"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-04483-5","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,1]]},"assertion":[{"value":"1 November 2019","order":1,"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":"We confirm that the manuscript has been read and approved by all named authors and that there are no other persons who satisfied the criteria for authorship but are not listed. We further confirm that the order of authors listed in the manuscript has been approved by all of us.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}