{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T07:33:26Z","timestamp":1771659206213,"version":"3.50.1"},"reference-count":83,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2022,4,28]],"date-time":"2022-04-28T00:00:00Z","timestamp":1651104000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,28]],"date-time":"2022-04-28T00:00:00Z","timestamp":1651104000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s11227-022-04418-2","type":"journal-article","created":{"date-parts":[[2022,4,28]],"date-time":"2022-04-28T10:05:12Z","timestamp":1651140312000},"page":"15905-15952","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A high-performance algorithm for finding influential nodes in large-scale social networks"],"prefix":"10.1007","volume":"78","author":[{"given":"Mohsen","family":"Taherinia","sequence":"first","affiliation":[]},{"given":"Mahdi","family":"Esmaeili","sequence":"additional","affiliation":[]},{"given":"Behrouz","family":"Minaei-Bidgoli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,28]]},"reference":[{"issue":"2","key":"4418_CR1","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/s10878-020-00684-z","volume":"41","author":"N Bohra","year":"2021","unstructured":"Bohra N, Bhatnagar V (2021) Group level social media popularity prediction by MRGB and Adam optimization. J Comb Optim 41(2):328\u2013347","journal-title":"J Comb Optim"},{"issue":"3","key":"4418_CR2","doi-asserted-by":"publisher","first-page":"242","DOI":"10.22452\/mjcs.vol34no3.2","volume":"34","author":"N Sangwan","year":"2021","unstructured":"Sangwan N, Bhatnagar V (2021) Video popularity prediction using stacked bilstm layers. Malays J Comput Sci 34(3):242\u2013254","journal-title":"Malays J Comput Sci"},{"key":"4418_CR3","doi-asserted-by":"publisher","first-page":"909","DOI":"10.3233\/JIFS-189759","volume":"42","author":"S Malik","year":"2022","unstructured":"Malik S, Bansal P (2022) Multimodal semantic analysis with regularized semantic autoencoder. J Intell Fuzzy Syst 42:909\u2013917","journal-title":"J Intell Fuzzy Syst"},{"key":"4418_CR4","doi-asserted-by":"publisher","first-page":"3417","DOI":"10.1007\/s10115-020-01461-4","volume":"62","author":"S Banerjee","year":"2020","unstructured":"Banerjee S, Jenamani M, Pratihar DK (2020) A survey on influence maximization in a social network. Knowl Inf Syst 62:3417\u20133455","journal-title":"Knowl Inf Syst"},{"key":"4418_CR5","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1109\/TKDE.2018.2807843","volume":"30","author":"Y Li","year":"2018","unstructured":"Li Y, Fan J, Wang Y, Tan K-LL (2018) Influence maximization on social graphs: a survey. IEEE Trans Knowl Data Eng 30:1852\u20131872","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"4418_CR6","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp\u00a057\u201366. Association for Computing Machinery (ACM)","DOI":"10.1145\/502512.502525"},{"key":"4418_CR7","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardose (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","DOI":"10.1145\/956750.956769"},{"key":"4418_CR8","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1016\/j.future.2018.07.015","volume":"89","author":"N Sumith","year":"2018","unstructured":"Sumith N, Annappa B, Bhattacharya S (2018) Influence maximization in large social networks: Heuristics, models and parameters. Future Gener Comput Syst 89:777\u2013790","journal-title":"Future Gener Comput Syst"},{"key":"4418_CR9","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1016\/j.future.2018.05.040","volume":"86","author":"S Peng","year":"2018","unstructured":"Peng S, Yu S, Mueller P (2018) Social networking big data: opportunities, solutions, and challenges. Future Gener Comput Syst 86:1456\u20131458","journal-title":"Future Gener Comput Syst"},{"issue":"3","key":"4418_CR10","doi-asserted-by":"publisher","first-page":"201","DOI":"10.3934\/mfc.2018010","volume":"1","author":"M Han","year":"2018","unstructured":"Han M, Li Y (2018) Influence analysis: a survey of the state-of-the-art. Math Found Comput 1(3):201\u2013253","journal-title":"Math Found Comput"},{"key":"4418_CR11","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.future.2021.01.025","volume":"118","author":"Z Wang","year":"2021","unstructured":"Wang Z, Sun C, Xi J, Li X (2021) Influence maximization in social graphs based on community structure and node coverage gain. Future Gener Comput Syst 118:327\u2013338","journal-title":"Future Gener Comput Syst"},{"key":"4418_CR12","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.ins.2019.10.064","volume":"513","author":"Q He","year":"2020","unstructured":"He Q, Wang X, Mao F, Lv J, Cai Y, Huang M, Xu Q (2020) CAOM: a community-based approach to tackle opinion maximization for social networks. Inf Sci 513:252\u2013269","journal-title":"Inf Sci"},{"key":"4418_CR13","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/s10489-019-01529-x","volume":"50","author":"H Huang","year":"2020","unstructured":"Huang H, Shen H, Meng Z (2020) Community-based influence maximization in attributed networks. Appl Intell 50:354\u2013364","journal-title":"Appl Intell"},{"key":"4418_CR14","first-page":"3","volume":"1","author":"HA Beni","year":"2020","unstructured":"Beni HA, Bouyer A (2020) TI-SC: top-k influential nodes selection based on community detection and scoring criteria in social networks. J Ambient Intell Humaniz Comput 1:3","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"4418_CR15","doi-asserted-by":"crossref","unstructured":"Zhang Z, Li X, Gan C (2020) Identifying influential nodes in social networks via community structure and influence distribution difference. Digit Commun Netw","DOI":"10.1016\/j.dcan.2020.04.011"},{"key":"4418_CR16","doi-asserted-by":"publisher","first-page":"101522","DOI":"10.1016\/j.is.2020.101522","volume":"92","author":"J Li","year":"2020","unstructured":"Li J, Cai T, Deng K, Wang X, Sellis T, Xia F (2020) Community-diversified influence maximization in social networks. Inf Syst 92:101522","journal-title":"Inf Syst"},{"key":"4418_CR17","doi-asserted-by":"publisher","first-page":"2435","DOI":"10.1007\/s12652-019-01286-2","volume":"11","author":"Y Atif","year":"2020","unstructured":"Atif Y, Al-Falahi K, Wangchuk T, Lindstr\u00f6m B (2020) A fuzzy logic approach to influence maximization in social networks. J Ambient Intell Hum Comput 11:2435\u20132451","journal-title":"J Ambient Intell Hum Comput"},{"key":"4418_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.eswa.2019.01.070","volume":"125","author":"S Banerjee","year":"2019","unstructured":"Banerjee S, Jenamani M, Pratihar DK (2019) ComBIM: a community-based solution approach for the Budgeted Influence Maximization Problem. Expert Syst Appl 125:1\u201313","journal-title":"Expert Syst Appl"},{"key":"4418_CR19","doi-asserted-by":"publisher","first-page":"2137","DOI":"10.1007\/s10489-018-1387-8","volume":"49","author":"H Huang","year":"2019","unstructured":"Huang H, Shen H, Meng Z, Chang H, He H (2019) Community-based influence maximization for viral marketing. Appl Intell 49:2137\u20132150","journal-title":"Appl Intell"},{"key":"4418_CR20","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1016\/j.physa.2018.09.142","volume":"514","author":"SS Singh","year":"2019","unstructured":"Singh SS, Kumar A, Singh K, Biswas B (2019) C2IM: community based context-aware influence maximization in social networks. Physica A 514:796\u2013818","journal-title":"Physica A"},{"key":"4418_CR21","unstructured":"Liqing Q, Wei J, Jinfeng Y, Xin F, Shuang Z (2019) PHG: a three-phase algorithm for influence maximization based on community structure. IEEE Access 1"},{"key":"4418_CR22","doi-asserted-by":"publisher","first-page":"1601","DOI":"10.1016\/j.neucom.2017.10.007","volume":"275","author":"X Li","year":"2018","unstructured":"Li X, Cheng X, Su S, Sun C (2018) Community-based seeds selection algorithm for location aware influence maximization. Neurocomputing 275:1601\u20131613","journal-title":"Neurocomputing"},{"key":"4418_CR23","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.ins.2018.07.003","volume":"465","author":"YY Ko","year":"2018","unstructured":"Ko YY, Cho KJ, Kim SW (2018) Efficient and effective influence maximization in social networks: a hybrid-approach. Inf Sci 465:144\u2013161","journal-title":"Inf Sci"},{"key":"4418_CR24","doi-asserted-by":"publisher","first-page":"47240","DOI":"10.1109\/ACCESS.2018.2866981","volume":"6","author":"F Ye","year":"2018","unstructured":"Ye F, Liu J, Chen C, Ling G, Zheng Z, Zhou Y (2018) Identifying influential individuals on large-scale social networks: a community based approach. IEEE Access 6:47240\u201347257","journal-title":"IEEE Access"},{"key":"4418_CR25","doi-asserted-by":"crossref","unstructured":"Jalayer M, Azheian M, Kermani Agha Mohammad Ali M (2018) A hybrid algorithm based on community detection and multi attribute decision making for influence maximization. Comput Ind Eng 120:234\u2013250","DOI":"10.1016\/j.cie.2018.04.049"},{"key":"4418_CR26","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2016.09.029","volume":"117","author":"J Shang","year":"2017","unstructured":"Shang J, Zhou S, Li X, Liu L, Wu H (2017) CoFIM: a community-based framework for influence maximization on large-scale networks. Knowl-Based Syst 117:88\u2013100","journal-title":"Knowl-Based Syst"},{"key":"4418_CR27","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, Wareham T (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"},{"key":"4418_CR28","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1177\/0165551515621005","volume":"43","author":"M Hosseini-Pozveh","year":"2017","unstructured":"Hosseini-Pozveh M, Zamanifar K, Naghsh-Nilchi AR (2017) A community-based approach to identify the most influential nodes in social networks. J Inf Sci 43:204\u2013220","journal-title":"J Inf Sci"},{"key":"4418_CR29","doi-asserted-by":"crossref","unstructured":"Halappanavar M, Sathanur AV, Nandi AK (2016) Accelerating the mining of influential nodes in complex networks through community detection. In: 2016 ACM International Conference on Computing Frontiers - Proceedings, New York, New York, USA, pp 64\u201371. Association for Computing Machinery, Inc","DOI":"10.1145\/2903150.2903181"},{"key":"4418_CR30","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, Sadegh Zahedi M, Rezvani M (2016) INCIM: a community-based algorithm for influence maximization problem under the linear threshold model. Inf Process Manag 52:1188\u20131199","journal-title":"Inf Process Manag"},{"key":"4418_CR31","doi-asserted-by":"crossref","unstructured":"Jaouadi M, Ben Romdhane L (2016) DIN: an efficient algorithm for detecting influential nodes in social graphs using network structure and attributes. In: Proceedings of IEEE\/ACS International Conference on Computer Systems and Applications, AICCSA. IEEE Computer Society","DOI":"10.1109\/AICCSA.2016.7945698"},{"key":"4418_CR32","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.neucom.2015.11.125","volume":"210","author":"Y Zhao","year":"2016","unstructured":"Zhao Y, Li S, Jin F (2016) Identification of influential nodes in social networks with community structure based on label propagation. Neurocomputing 210:34\u201344","journal-title":"Neurocomputing"},{"key":"4418_CR33","doi-asserted-by":"publisher","first-page":"1353","DOI":"10.1016\/j.eswa.2014.09.037","volume":"42","author":"K Rahimkhani","year":"2015","unstructured":"Rahimkhani K, Aleahmad A, Rahgozar M, Moeini A (2015) A fast algorithm for finding most influential people based on the linear threshold model. Expert Syst Appl 42:1353\u20131361","journal-title":"Expert Syst Appl"},{"key":"4418_CR34","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00778-014-0366-x","volume":"24","author":"H Li","year":"2015","unstructured":"Li H, Bhowmick SS, Sun A, Cui J (2015) Conformity-aware influence maximization in online social networks. VLDB J 24:117\u2013141","journal-title":"VLDB J"},{"key":"4418_CR35","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, Lee WC, Lee SY (2014) CIM: community-based influence maximization in social networks. ACM Trans Intell Syst Technol 5:1\u201331","journal-title":"ACM Trans Intell Syst Technol"},{"key":"4418_CR36","doi-asserted-by":"crossref","unstructured":"Wang Y, Cong G, Song G, Xie K (2010) 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 - KDD \u201910, New York, New York, USA, p\u00a01039. ACM Press","DOI":"10.1145\/1835804.1835935"},{"key":"4418_CR37","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2006","unstructured":"Fortunato S, Barthelemy M (2006) Resolution limit in community detection. Proc Natl Acad Sci USA 104:36\u201341","journal-title":"Proc Natl Acad Sci USA"},{"key":"4418_CR38","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E Stat Nonlinear Soft Matter Phys 76:036106","journal-title":"Phys Rev E Stat Nonlinear Soft Matter Phys"},{"key":"4418_CR39","doi-asserted-by":"crossref","unstructured":"Leung IXY, Hui P, Lio P, Crowcroft J (2008) Towards real-time community detection in large networks. Phys Rev Stat Nonlinear Soft Matter Phys 79:066107","DOI":"10.1103\/PhysRevE.79.066107"},{"key":"4418_CR40","doi-asserted-by":"publisher","first-page":"026129","DOI":"10.1103\/PhysRevE.80.026129","volume":"80","author":"MJ Barber","year":"2009","unstructured":"Barber MJ, Clark JW (2009) Detecting network communities by propagating labels under constraints. Phys Rev Stat Nonlinear Soft Matter Phys 80:026129","journal-title":"Phys Rev Stat Nonlinear Soft Matter Phys"},{"key":"4418_CR41","doi-asserted-by":"publisher","first-page":"036103","DOI":"10.1103\/PhysRevE.83.036103","volume":"83","author":"L \u0160ubelj","year":"2011","unstructured":"\u0160ubelj L, Bajec M (2011) Unfolding communities in large complex networks: combining defensive and offensive label propagation for core extraction. Phys Rev E Stat Nonlinear Soft Matter Phys 83:036103","journal-title":"Phys Rev E Stat Nonlinear Soft Matter Phys"},{"key":"4418_CR42","doi-asserted-by":"crossref","unstructured":"Rezaei A, Far SM, Soleymani M (2015) Near linear-time community detection in networks with hardly detectable community structure. In: Proceedings of the 2015 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015, pp\u00a065\u201372. Association for Computing Machinery, Inc","DOI":"10.1145\/2808797.2808903"},{"key":"4418_CR43","first-page":"6","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E Stat Phys Plasmas Fluids Relat Interdiscip Top 70:6","journal-title":"Phys Rev E Stat Phys Plasmas Fluids Relat Interdiscip Top"},{"key":"4418_CR44","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008:P10008","journal-title":"J Stat Mech Theory Exp"},{"key":"4418_CR45","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2007","unstructured":"Rosvall M, Bergstrom CT (2007) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci USA 105:1118\u20131123","journal-title":"Proc Natl Acad Sci USA"},{"key":"4418_CR46","doi-asserted-by":"crossref","unstructured":"Xavier CR , Da Fonseca Vieira V, Evsukoff AG (2019) Studying the effect of community structure for seed selection in an influence model. Int J Inf Decis Sci 11(4):300\u2013319","DOI":"10.1504\/IJIDS.2019.103355"},{"key":"4418_CR47","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, Vanbriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, New York, USA, pp\u00a0420\u2013429. ACM Press","DOI":"10.1145\/1281192.1281239"},{"key":"4418_CR48","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan L.\u00a0V. (2011) CELF++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011, pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"4418_CR49","doi-asserted-by":"crossref","unstructured":"Tang Y, Xiao X, Shi Y (2014) Influence maximization: Near-optimal time complexity meets practical efficiency. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, New York, New York, USA, pp\u00a075\u201386. Association for Computing Machinery","DOI":"10.1145\/2588555.2593670"},{"key":"4418_CR50","doi-asserted-by":"crossref","unstructured":"Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: a martingale approach. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, vol.\u00a02015-May, New York, New York, USA, pp\u00a01539\u20131554. Association for Computing Machinery","DOI":"10.1145\/2723372.2723734"},{"key":"4418_CR51","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, New York, USA, pp\u00a0199\u2013207. ACM Press","DOI":"10.1145\/1557019.1557047"},{"key":"4418_CR52","doi-asserted-by":"crossref","unstructured":"Cheng S, Shen H, Huang J, Zhang G, Cheng X (2013) StaticGreedy: solving the scalability-accuracy dilemma in influence maximization. In: International Conference on Information and Knowledge Management, Proceedings, New York, New York, USA, pp\u00a0509\u2013518. ACM Press","DOI":"10.1145\/2505515.2505541"},{"key":"4418_CR53","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jnca.2018.01.005","volume":"106","author":"S Peng","year":"2018","unstructured":"Peng S, Zhou Y, Cao L, Yu S, Niu J, Jia W (2018) Influence analysis in social networks: a survey. J Netw Comput Appl 106:17\u201332","journal-title":"J Netw Comput Appl"},{"key":"4418_CR54","unstructured":"Page L, Page L, Brin S, Motwani R, Winograd T (1998) The PageRank citation ranking: bringing order to the web"},{"issue":"5","key":"4418_CR55","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg JM (1999) Authoritative sources in a hyperlinked environment. J ACM 46(5):604\u2013632","journal-title":"J ACM"},{"key":"4418_CR56","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/s10618-009-0150-5","volume":"20","author":"M Kimura","year":"2010","unstructured":"Kimura M, Saito K, Nakano R, Motoda H (2010) Extracting influential nodes on a social network for information diffusion. Data Min Knowl Discov 20:70\u201397","journal-title":"Data Min Knowl Discov"},{"key":"4418_CR57","doi-asserted-by":"crossref","unstructured":"Wang C, Chen W, Wang, Y (2012) Scalable influence maximization for independent cascade model in large-scale social networks. In: Data Mining and Knowledge Discovery, vol.\u00a025, pp\u00a0545\u2013576. Springer","DOI":"10.1007\/s10618-012-0262-1"},{"key":"4418_CR58","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, New York, USA, pp\u00a01029\u20131038. ACM Press","DOI":"10.1145\/1835804.1835934"},{"key":"4418_CR59","unstructured":"Kim J, Kim SK, Yu H (2013) Scalable and parallelizable processing of influence maximization for large-scale social networks? In: Proceedings of International Conference on Data Engineering, pp 266\u2013277"},{"key":"4418_CR60","doi-asserted-by":"crossref","unstructured":"Galhotra S, Arora A, Roy S (2016) Holistic influence maximization: combining scalability and efficiency with opinion-aware models. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, vol.\u00a026-June-20, pp\u00a0743\u2013758","DOI":"10.1145\/2882903.2882929"},{"key":"4418_CR61","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) SIMPATH: an efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th International Conference on Data Mining, pp\u00a0211\u2013220. IEEE","DOI":"10.1109\/ICDM.2011.132"},{"key":"4418_CR62","doi-asserted-by":"crossref","unstructured":"Chen W, Yuan Y, Zhang L (2010) Scalable influence maximization in social networks under the linear threshold model. In: Proceedings of IEEE International Conference on Data Mining, ICDM, pp\u00a088\u201397","DOI":"10.1109\/ICDM.2010.118"},{"key":"4418_CR63","doi-asserted-by":"crossref","unstructured":"Jung K, Heo W, Chen W (2012) IRIE: scalable and robust influence maximization in social networks. In: Proceedings of IEEE International Conference on Data Mining, ICDM, pp 918\u2013923","DOI":"10.1109\/ICDM.2012.79"},{"key":"4418_CR64","doi-asserted-by":"crossref","unstructured":"Liu Q, Xiang B, Chen E, Xiong H, Tang F, Yu JX (2014) Influence maximization over large-scale social networks: a bounded linear approach. In: CIKM 2014\u2014Proceedings of the 2014 ACM International Conference on Information and Knowledge Management, New York, New York, USA, pp\u00a0171\u2013180.Association for Computing Machinery, Inc","DOI":"10.1145\/2661829.2662009"},{"key":"4418_CR65","doi-asserted-by":"crossref","unstructured":"Cheng S, Shen H-W, Huang J, Chen W, Cheng X-Q (2014) IMRank: influence maximization via finding self-consistent ranking. In: SIGIR 2014 - Proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp\u00a0475\u2013484","DOI":"10.1145\/2600428.2609592"},{"key":"4418_CR66","doi-asserted-by":"crossref","unstructured":"Bahutair M, Al Aghbari Z, Kamel I (2021) NodeRank: finding influential nodes in social networks based on interests. J Supercomput 1\u201327","DOI":"10.1007\/s11227-021-03947-6"},{"key":"4418_CR67","unstructured":"Khan BS, Niazi MA (2017) Network community detection: a review and visual survey. arXiv"},{"key":"4418_CR68","doi-asserted-by":"crossref","unstructured":"Xie J, Szymanski BK, Liu X (2011) SLPA: uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process.\u2019 In: Proceedings - IEEE International Conference on Data Mining, ICDM, pp\u00a0344\u2013349","DOI":"10.1109\/ICDMW.2011.154"},{"key":"4418_CR69","doi-asserted-by":"crossref","unstructured":"Khomami MMD, Rezvanian A, Meybodi MR, Bagheri A (2020) CFIN: a community-based algorithm for finding influential nodes in complex social networks. J Supercomput 1\u201330","DOI":"10.1109\/IKT51791.2020.9345622"},{"key":"4418_CR70","doi-asserted-by":"publisher","first-page":"126258","DOI":"10.1016\/j.physa.2021.126258","volume":"582","author":"AM Samir","year":"2021","unstructured":"Samir AM, Rady S, Gharib TF (2021) LKG: a fast scalable community-based approach for influence maximization problem in social networks. Physica A 582:126258","journal-title":"Physica A"},{"key":"4418_CR71","doi-asserted-by":"publisher","first-page":"107497","DOI":"10.1016\/j.knosys.2021.107497","volume":"233","author":"X Xie","year":"2021","unstructured":"Xie X, Li J, Sheng Y, Wang W, Yang W (2021) Competitive influence maximization considering inactive nodes and community homophily. Knowl-Based Syst 233:107497","journal-title":"Knowl-Based Syst"},{"key":"4418_CR72","doi-asserted-by":"publisher","first-page":"123590","DOI":"10.1016\/j.physa.2019.123590","volume":"545","author":"A Ahmad","year":"2020","unstructured":"Ahmad A, Ahmad T, Bhatt A (2020) HWSMCB: a community-based hybrid approach for identifying influential nodes in the social network. Physica A 545:123590","journal-title":"Physica A"},{"issue":"3","key":"4418_CR73","first-page":"16","volume":"13","author":"B Amiri","year":"2021","unstructured":"Amiri B, Fathian M, Asaadi E (2021) Influence maximization in complex social networks based on community structure. J Ind Syst Eng 13(3):16\u201340","journal-title":"J Ind Syst Eng"},{"key":"4418_CR74","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci USA 103:8577\u20138582","journal-title":"Proc Natl Acad Sci USA"},{"key":"4418_CR75","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1007\/BF02181260","volume":"87","author":"JF Douglas","year":"1997","unstructured":"Douglas JF (1997) Random walks and random environments, vol. 2, random environments. J Stat Phys 87:961\u2013962","journal-title":"J Stat Phys"},{"key":"4418_CR76","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1038\/nature09182","volume":"466","author":"Y-Y Ahn","year":"2009","unstructured":"Ahn Y-Y, Bagrow JP, Lehmann S (2009) Link communities reveal multiscale complexity in networks. Nature 466:761\u2013764","journal-title":"Nature"},{"key":"4418_CR77","doi-asserted-by":"crossref","unstructured":"Palla G, Derenyi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society","DOI":"10.1038\/nature03607"},{"key":"4418_CR78","doi-asserted-by":"crossref","unstructured":"Scripps J, Tan PN, Esfahanian AH (2007) Exploration of link structure and community-based node roles in network analysis. In: Proceedings of IEEE International Conference on Data Mining, ICDM, pp\u00a0649\u2013654. IEEE","DOI":"10.1109\/ICDM.2007.37"},{"key":"4418_CR79","doi-asserted-by":"crossref","unstructured":"Panagopoulos\u00e9cole G, Malliaros FD, Vazirgiannis\u00e9cole M (2020) Influence maximization using influence and susceptibility embeddings. Technical Report","DOI":"10.1609\/icwsm.v14i1.7319"},{"issue":"1","key":"4418_CR80","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2898361","volume":"8","author":"J Leskovec","year":"2016","unstructured":"Leskovec J, Sosi\u010d R (2016) SNAP: a general-purpose network analysis and graph-mining library. ACM Trans Intell Syst Technol (TIST) 8(1):1","journal-title":"ACM Trans Intell Syst Technol (TIST)"},{"key":"4418_CR81","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013) The Koblenz Network Collection (KONECT)","DOI":"10.1145\/2487788.2488173"},{"key":"4418_CR82","unstructured":"Leskovec J, Krevl A (2014) Snap datasets, s.n.a.p. and stanford . Acessed Oct 25 2020"},{"key":"4418_CR83","doi-asserted-by":"publisher","first-page":"4747","DOI":"10.1007\/s11227-019-03061-8","volume":"76","author":"M Haque","year":"2019","unstructured":"Haque M, Banerjee DS (2019) Accelerating influence maximization using heterogeneous algorithms. J Supercomput 76:4747\u20134769","journal-title":"J Supercomput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04418-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04418-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04418-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,3]],"date-time":"2023-02-03T21:39:49Z","timestamp":1675460389000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04418-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,28]]},"references-count":83,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["4418"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04418-2","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,28]]},"assertion":[{"value":"28 February 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}