{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T01:45:33Z","timestamp":1774057533203,"version":"3.50.1"},"reference-count":81,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T00:00:00Z","timestamp":1698624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T00:00:00Z","timestamp":1698624000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s11227-023-05695-1","type":"journal-article","created":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T09:02:22Z","timestamp":1698656542000},"page":"6809-6854","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Influence maximization (IM) in complex networks with limited visibility using statistical methods"],"prefix":"10.1007","volume":"80","author":[{"given":"Saeid","family":"Ghafouri","sequence":"first","affiliation":[]},{"given":"Seyed Hossein","family":"Khasteh","sequence":"additional","affiliation":[]},{"given":"Seyed Omid","family":"Azarkasb","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,30]]},"reference":[{"key":"5695_CR1","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"issue":"3","key":"5695_CR2","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1080\/10618600.2017.1286243","volume":"26","author":"Y Zhao","year":"2017","unstructured":"Zhao Y, Wu YJ, Levina E, Zhu J (2017) Link prediction for partially observed networks. J Comput Graph Stat 26(3):725\u2013733","journal-title":"J Comput Graph Stat"},{"key":"5695_CR3","unstructured":"Zhang C, Zhai BY, Wu M (2023) Link prediction of community in microblog based on exponential random graph model. In: 16th International Symposium on Wireless Personal Multimedia Communications (WPMC), Atlantic City, NJ, USA"},{"key":"5695_CR4","unstructured":"Shojaie A (2013) Link prediction in biological networks using multi-mode exponential random graph models. In: Eleventh Workshop on Mining and Learning with Graphs. Chicago, Illinois, USA, pp 971\u2013978"},{"key":"5695_CR5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.4159\/9780674029095","volume-title":"Structural holes: the social structure of competition","author":"RS Burt","year":"1992","unstructured":"Burt RS (1992) Structural holes: the social structure of competition. Harvard University Press, Cambridge, p 313"},{"key":"5695_CR6","doi-asserted-by":"crossref","unstructured":"Fisher ML, Nemhauser GL, Wolsey LA (1978) An analysis of approximations for maximizing submodular set functions\u2014II, Polyhedral Combinatorics, pp 73\u201387","DOI":"10.1007\/BFb0121195"},{"key":"5695_CR7","unstructured":"Peng B (2021) Dynamic influence maximization. In: 35th Conference on Neural Information Processing Systems"},{"key":"5695_CR8","doi-asserted-by":"crossref","unstructured":"Jung K, Heo W, Chen W (2012) IRIE: scalable and robust influence maximization in social networks. In: IEEE 12th International Conference on Data Mining, pp 918\u2013923","DOI":"10.1109\/ICDM.2012.79"},{"key":"5695_CR9","doi-asserted-by":"crossref","unstructured":"Cheng S, Shen H, Huang J, Chen W, Cheng X (2014) IMRank: influence maximization via finding self-consistent ranking. In: Proceedings of the 37th International ACM SIGIR Conference on Research & Development in Information Retrieval, pp 475\u2013484","DOI":"10.1145\/2600428.2609592"},{"key":"5695_CR10","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: Proceedings of the 22nd ACM International Conference on Information & Knowledge Management, pp 509\u2013518","DOI":"10.1145\/2505515.2505541"},{"key":"5695_CR11","doi-asserted-by":"crossref","unstructured":"Jabari Lotfi J, Abdollahi Azgomi M, Ebrahimi Dishabi MR (2022) An improved influence maximization method for social networks based on genetic algorithm, ELSEVIER. Phys A Stat Mech Appl 586","DOI":"10.1016\/j.physa.2021.126480"},{"key":"5695_CR12","doi-asserted-by":"crossref","unstructured":"Zhang S, Huang Y, Sun J, Lin W, Xiao X, Tang B (2023) Capacity constrained influence maximization in social networks, The technical report in SIGKDD'23, Long Beach, CA, USA","DOI":"10.1145\/3580305.3599267"},{"key":"5695_CR13","unstructured":"Yuxin Y, Chen Y, Han W (2022) Influence maximization in social networks: theories, methods and challenges, ELSEVIER, Array, vol 6"},{"key":"5695_CR14","volume-title":"Influence maximization in social networks: a survey of behaviour-aware methods","author":"A Zareie","year":"2023","unstructured":"Zareie A, Sakellariou R (2023) Influence maximization in social networks: a survey of behaviour-aware methods. Springer, Berlin"},{"key":"5695_CR15","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LVS (2011) SIMPATH: an efficient algorithm for influence maximization under the linear threshold model. In: IEEE 11th International Conference on Data Mining, Vancouver, BC, Canada, pp 211\u2013220","DOI":"10.1109\/ICDM.2011.132"},{"key":"5695_CR16","first-page":"4","volume":"51","author":"S Kumar","year":"2021","unstructured":"Kumar S, Singhla L, Jindal K, Grover K (2021) IM-ELPR: influence maximization in social networks using label propagation based community structure. Appl Intell 51:4\u20135","journal-title":"Appl Intell"},{"key":"5695_CR17","doi-asserted-by":"crossref","unstructured":"Galhotra S, Arora A, Virinchi S, Roy S (2015) ASIM: a scalable algorithm for influence maximization under the independent cascade model. In: Proceedings of the 24th International Conference on World Wide Web, Florence, Italy, pp 35\u201336","DOI":"10.1145\/2740908.2742725"},{"key":"5695_CR18","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1038\/s41598-023-33010-8","volume":"13","author":"A Rezvanian","year":"2023","unstructured":"Rezvanian A, Vahidipour SM, Meybodi MR (2023) A new stochastic diffusion model for influence maximization in social networks. Sci Rep 13:67\u201375","journal-title":"Sci Rep"},{"key":"5695_CR19","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.physa.2015.10.020","volume":"444","author":"Q Wang","year":"2016","unstructured":"Wang Q, Jin Y, Lin Z, Cheng S, Yang T (2016) Influence maximization in social networks under an independent cascade-based model. Physica A 444:20\u201334","journal-title":"Physica A"},{"key":"5695_CR20","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LVS (2011) CELF++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th International Conference Companion on World Wide Web, Hyderabad, India, pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"5695_CR21","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 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"5695_CR22","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge discovery and Data mining, Paris, France, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"5695_CR23","first-page":"259","volume":"4213","author":"M Kimura","year":"2006","unstructured":"Kimura M, Saito K (2006) Tractable models for information diffusion in social networks. Eur Conf Princ Data Mini Knowl Dis 4213:259\u2013271","journal-title":"Eur Conf Princ Data Mini Knowl Dis"},{"key":"5695_CR24","unstructured":"Hao F, Chen M, Zhu C, Guizani M (2012) Discovering influential users in micro-blog marketing with influence maximization mechanism. In: IEEE Global Communications Conference (GLOBECOM), Anaheim, CA, USA, pp 470\u2013474"},{"key":"5695_CR25","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.asoc.2018.02.016","volume":"66","author":"Q He","year":"2018","unstructured":"He Q, Wang X, Huang M, Lv J, Ma L (2018) Heuristics-based influence maximization for opinion formation in social networks. Appl Soft Comput 66:360\u2013369","journal-title":"Appl Soft Comput"},{"key":"5695_CR26","unstructured":"Stein S, Eshghi S, Maghsudi S, Tassiulas L, Bellamy RKE, Jennings NR (2017) Heuristic algorithms for influence maximization in partially observable social networks. In: Proceedings of the 3rd International Workshop on Social Influence Analysis, Melbourne, Australia"},{"issue":"3","key":"5695_CR27","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1007\/s10586-017-0732-8","volume":"20","author":"L Yang","year":"2017","unstructured":"Yang L, Tian Y, Li J, Ma J, Zhang J (2017) Identifying opinion leaders in social networks with topic limitation. Clust Comput 20(3):2403\u20132413","journal-title":"Clust Comput"},{"key":"5695_CR28","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1016\/j.neucom.2017.04.064","volume":"260","author":"Z Wang","year":"2017","unstructured":"Wang Z, Du C, Fan J, Xing Y (2017) Ranking influential nodes in social networks based on node position and neighborhood. Neurocomputing 260:466\u2013477","journal-title":"Neurocomputing"},{"key":"5695_CR29","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.knosys.2017.11.021","volume":"141","author":"ZZ Alp","year":"2018","unstructured":"Alp ZZ, Oguducu SG (2018) Identifying topical influencers on twitter based on user behavior and network topology. Knowl-Based Syst 141:211\u2013221","journal-title":"Knowl-Based Syst"},{"key":"5695_CR30","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.physa.2017.08.126","volume":"491","author":"RL de Andrade","year":"2018","unstructured":"de Andrade RL, Rego LC (2018) The use of nodes attributes in social network analysis with an application to an international trade network. Physica A 491:249\u2013270","journal-title":"Physica A"},{"key":"5695_CR31","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.socnet.2017.11.004","volume":"54","author":"S Ahajjam","year":"2018","unstructured":"Ahajjam S, El Haddad M, Badir H (2018) A new scalable leader-community detection approach for community detection in social networks. Soc Netw 54:41\u201349","journal-title":"Soc Netw"},{"key":"5695_CR32","doi-asserted-by":"crossref","first-page":"6955","DOI":"10.1038\/s41598-018-24874-2","volume":"8","author":"A Azcorra","year":"2018","unstructured":"Azcorra A, Chiroque LF, Cuevas R, Anta AF, Laniado H, Lillo RE, Romo J, Sguera C (2018) Unsupervised scalable statistical method for identifying influential users in online social networks. Sci Rep 8:6955","journal-title":"Sci Rep"},{"key":"5695_CR33","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.future.2018.11.023","volume":"94","author":"A Zareie","year":"2019","unstructured":"Zareie A, Sheikhahmadi A, Jalili M (2019) Influential node ranking in social networks based on neighborhood diversity. Fut Gener Comput Syst 94:120\u2013129","journal-title":"Fut Gener Comput Syst"},{"key":"5695_CR34","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.future.2018.08.047","volume":"91","author":"S Wang","year":"2019","unstructured":"Wang S, Cuomo S, Mei G, Cheng W, Xu N (2019) Efficient method for identifying influential vertices in dynamic networks using the strategy of local detection and updating. Futur Gener Comput Syst 91:10\u201324","journal-title":"Futur Gener Comput Syst"},{"key":"5695_CR35","first-page":"52238","volume":"553","author":"S Kumar","year":"2020","unstructured":"Kumar S, Panda BS (2020) Identifying influential nodes in social networks: neighborhood coreness based voting approach. Physica A Stat Mech Appl 553:52238","journal-title":"Physica A Stat Mech Appl"},{"key":"5695_CR36","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.chaos.2018.03.014","volume":"110","author":"K Berahmand","year":"2018","unstructured":"Berahmand K, Bouyer A, Samadi N (2018) A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks. Chaos Solitons Fractals 110:41\u201354","journal-title":"Chaos Solitons Fractals"},{"key":"5695_CR37","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/j.knosys.2020.105580","volume":"194","author":"A Zareie","year":"2020","unstructured":"Zareie A, Sheikhahmadi A, Jalili M, Fasaei MSK (2020) Finding influential nodes in social networks based on neighborhood correlation coefficient. Knowl-Based Syst 194:528","journal-title":"Knowl-Based Syst"},{"key":"5695_CR38","doi-asserted-by":"crossref","first-page":"1711","DOI":"10.1007\/s00607-018-0684-8","volume":"110","author":"K Berahmand","year":"2019","unstructured":"Berahmand K, Bouyer A, Samadi N (2019) A new local and multidimensional ranking measure to detect spreaders in social networks. Computing 110:1711\u20131733","journal-title":"Computing"},{"key":"5695_CR39","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/978-981-13-9042-5_39","volume":"5","author":"S Debnath","year":"2020","unstructured":"Debnath S, Sarkar D, Jana P (2020) Top-k influential nodes identification based on activity behaviors in egocentric online social networks. Comput Intell Pattern Recogn 5:463\u2013475","journal-title":"Comput Intell Pattern Recogn"},{"issue":"7","key":"5695_CR40","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1002\/dac.3090","volume":"29","author":"MAMA Kermani","year":"2016","unstructured":"Kermani MAMA, Aliahmadi A, Hanneman R (2016) Optimizing the choice of influential nodes for diffusion on a social network. Int J Commun Syst 29(7):1235\u20131250","journal-title":"Int J Commun Syst"},{"issue":"2","key":"5695_CR41","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1109\/TKDE.2016.2620141","volume":"29","author":"G Song","year":"2017","unstructured":"Song G, Li Y, Chen X, He X, Tang J (2017) Influential node tracking on dynamic social network: an interchange greedy approach. IEEE Trans Knowl Data Eng 29(2):359\u2013372","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"5695_CR42","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s13278-018-0548-4","volume":"9","author":"JS More","year":"2019","unstructured":"More JS, Lingam C (2019) A gradient-based methodology for optimizing time for influence diffusion in social networks. Soc Netw Anal Mini 9:5","journal-title":"Soc Netw Anal Mini"},{"key":"5695_CR43","doi-asserted-by":"crossref","first-page":"12084","DOI":"10.1109\/ACCESS.2020.2966056","volume":"8","author":"Q Liqing","year":"2020","unstructured":"Liqing Q, Chunmei G, Shuang Z, Xiangbo T, Mingjv Z (2020) TSIM: a two-stage selection algorithm for influence maximization in social networks. IEEE Access 8:12084\u201312095","journal-title":"IEEE Access"},{"key":"5695_CR44","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.dcan.2020.04.011","volume":"7","author":"Z Zhang","year":"2021","unstructured":"Zhang Z, Li X, Gan C (2021) Identifying influential nodes in social networks via community structure and influence distribution difference. Dig Commun Netw 7:131\u2013139","journal-title":"Dig Commun Netw"},{"key":"5695_CR45","first-page":"1","volume":"5","author":"A Ullah","year":"2021","unstructured":"Ullah A, Wang B, Sheng J, Long J, Khan N (2021) Identification of influential nodes via effective distance-based centrality mechanism in complex networks. Complexity 5:1\u201316","journal-title":"Complexity"},{"key":"5695_CR46","first-page":"12","volume":"32","author":"K Berahmand","year":"2018","unstructured":"Berahmand K, Samadi N, Sheikholeslami SM (2018) Effect of rich-club on diffusion in complex networks. Int J Modern Phys B 32:12","journal-title":"Int J Modern Phys B"},{"issue":"1","key":"5695_CR47","doi-asserted-by":"crossref","first-page":"2022","DOI":"10.1038\/s41598-021-81663-0","volume":"12","author":"B Wang","year":"1833","unstructured":"Wang B, Zhang J, Dai J, Sheng J (1833) Influential nodes identification using network local structural properties. Sci Rep 12(1):2022","journal-title":"Sci Rep"},{"issue":"5","key":"5695_CR48","first-page":"592","volume":"13","author":"MF Mukhtar","year":"2022","unstructured":"Mukhtar MF, Abas ZA, Rasib AHA, Anuar SHH, Zaki NHM, Rahman AFNA, Abidin ZZ, Shibghatullah AS (2022) Identifying influential nodes with centrality indices combinations using symbolic regression. Int J Adv Comput Sci Appl 13(5):592\u2013599","journal-title":"Int J Adv Comput Sci Appl"},{"key":"5695_CR49","doi-asserted-by":"crossref","unstructured":"Budak C, Agrawal D, El Abbadi A (2011) Limiting the spread of misinformation in social networks. In: Proceedings of the 20th International Conference on World Wide Web, pp 665\u2013674, Hyderabad, India","DOI":"10.1145\/1963405.1963499"},{"key":"5695_CR50","doi-asserted-by":"crossref","unstructured":"He X, Song G, Chen W, Jiang Q (2012) Influence blocking maximization in social networks under the competitive linear threshold model. In: Proceedings of the 2012 SIAM International Conference on Data Mining, Society for Industrial and Applied Mathematics, pp 463\u2013474","DOI":"10.1137\/1.9781611972825.40"},{"key":"5695_CR51","doi-asserted-by":"crossref","unstructured":"Fan L, Lu Z, Wu W, Thuraisingham B, Ma H, Bi Y (2013) Least cost rumor blocking in social networks. In: IEEE 33rd International Conference on Distributed Computing Systems, pp 540\u2013549, Philadelphia, PA, USA","DOI":"10.1109\/ICDCS.2013.34"},{"key":"5695_CR52","doi-asserted-by":"crossref","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"},{"issue":"10","key":"5695_CR53","doi-asserted-by":"crossref","first-page":"2168","DOI":"10.1109\/TKDE.2017.2728064","volume":"29","author":"B Wang","year":"2017","unstructured":"Wang B, Chen G, Fu L, Song L, Wang X (2017) DRIMUX: dynamic rumor influence minimization with user experience in social networks. IEEE Trans Knowl Data Eng 29(10):2168\u20132181","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"5695_CR54","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.comnet.2017.05.004","volume":"123","author":"P Wu","year":"2017","unstructured":"Wu P, Pan L (2017) Scalable influence blocking maximization in social networks under competitive independent cascade models. Comput Netw 123:38\u201350","journal-title":"Comput Netw"},{"key":"5695_CR55","doi-asserted-by":"crossref","unstructured":"Yang W, Brenner L, Giua A (2018) Influence maximization by link activation in social networks. In: IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA), Turin, Italy","DOI":"10.1109\/ETFA.2018.8502577"},{"issue":"1","key":"5695_CR56","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10107-018-1288-y","volume":"170","author":"M Fischetti","year":"2018","unstructured":"Fischetti M, Kahr M, Leitner M, Monaci M, Ruthmair M (2018) Least cost influence propagation in (Social) networks. Math Program 170(1):293\u2013325","journal-title":"Math Program"},{"key":"5695_CR57","doi-asserted-by":"crossref","unstructured":"Bucur D, Iacca G, Marcelli A, Squillero G, Tonda A (2018) Improving multi-objective evolutionary influence maximization in social networks. In: International Conference on the Applications of Evolutionary Computation, pp 117\u2013124","DOI":"10.1007\/978-3-319-77538-8_9"},{"key":"5695_CR58","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1016\/j.ins.2017.09.034","volume":"422","author":"CT Li","year":"2018","unstructured":"Li CT, Lin YJ, Yeh MY (2018) Forecasting participants of information diffusion on social networks with its applications. Inf Sci 422:432\u2013446","journal-title":"Inf Sci"},{"key":"5695_CR59","doi-asserted-by":"crossref","unstructured":"Gulati A, Eirinaki M (2018) Influence propagation for social graph-based recommendations. In: IEEE International Conference on Big Data, Seattle, WA, USA, pp 2180\u20132189","DOI":"10.1109\/BigData.2018.8622213"},{"key":"5695_CR60","doi-asserted-by":"crossref","first-page":"75696","DOI":"10.1109\/ACCESS.2019.2922474","volume":"7","author":"G Xie","year":"2019","unstructured":"Xie G, Chen Y, Zhang H, Liu Y (2019) MBIC: a novel influence propagation model for membership-based influence maximization in social networks. IEEE Access 7:75696\u201375707","journal-title":"IEEE Access"},{"key":"5695_CR61","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1016\/j.ins.2019.10.075","volume":"513","author":"Y Chen","year":"2020","unstructured":"Chen Y, Qu Q, Ying Y, Li H, Shen J (2020) Semantics-aware influence maximization in social networks. Inf Sci 513:442\u2013464","journal-title":"Inf Sci"},{"issue":"6","key":"5695_CR62","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s00607-019-00778-5","volume":"106","author":"X Rui","year":"2020","unstructured":"Rui X, Yang X, Fan J, Wang Z (2020) A neighbour scale fixed approach for influence maximization in social networks. Computing 106(6):427\u2013449","journal-title":"Computing"},{"key":"5695_CR63","doi-asserted-by":"crossref","unstructured":"Wu Q, Zhou L, Huang Y (2020) Influence maximization based on community closeness in social networks. In: Web Information Systems Engineering, Singapore, pp 142\u2013156","DOI":"10.1007\/978-981-15-3281-8_13"},{"issue":"3","key":"5695_CR64","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":"5695_CR65","doi-asserted-by":"crossref","unstructured":"Wang W, Yang H, Lu Y, Zou Y, Zhang X, Guo S, Lin L (2021) Influence maximization in multi-relational social networks. In: 30th ACM International Conference on Information and Knowledge Management","DOI":"10.1145\/3459637.3481928"},{"key":"5695_CR66","first-page":"528","volume":"586","author":"JJ Lotf","year":"2022","unstructured":"Lotf JJ, Azgomi MA, Dishabi MRE (2022) An improved influence maximization method for social networks based on genetic algorithm. Physica A Stat Mech Appl 586:528","journal-title":"Physica A Stat Mech Appl"},{"key":"5695_CR67","doi-asserted-by":"crossref","unstructured":"S. Kummar, A. Mallik, A. Khetarpal, B.S. panda, \"Influence maximization in social networks using graph embedding and graph neural network\", Information Sciences, 2022.","DOI":"10.1016\/j.ins.2022.06.075"},{"key":"5695_CR68","first-page":"5236","volume":"212","author":"S Kumar","year":"2023","unstructured":"Kumar S, Mallik A, Panda BS (2023) Influence maximization in social networks using transfer learning via graph-based LSTM. Expert Syst Appl 212:5236","journal-title":"Expert Syst Appl"},{"issue":"395","key":"5695_CR69","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1080\/01621459.1986.10478342","volume":"81","author":"O Frank","year":"1986","unstructured":"Frank O, Strauss D (1986) Markov graphs. J Am Stat Assoc 81(395):832\u2013842","journal-title":"J Am Stat Assoc"},{"issue":"2","key":"5695_CR70","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.socnet.2006.08.002","volume":"29","author":"G Robins","year":"2007","unstructured":"Robins G, Pattison P, Kalish Y, Lusher D (2007) An introduction to exponential random graph (p*) models for social networks. Soc Netw 29(2):173\u2013191","journal-title":"Soc Netw"},{"issue":"1","key":"5695_CR71","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1111\/j.1467-9531.2006.00176.x","volume":"36","author":"TAB Snijders","year":"2006","unstructured":"Snijders TAB, Pattison PE, Robins GL, Handcock MS (2006) New specifications for exponential random graph models. Sociol Methodol 36(1):99\u2013152","journal-title":"Sociol Methodol"},{"key":"5695_CR72","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511894701","volume-title":"Exponential random graph models for social networks: theory, methods, and applications","author":"D Lusher","year":"2012","unstructured":"Lusher D, Koskinen J, Robins G (2012) Exponential random graph models for social networks: theory, methods, and applications. Cambridge University Press, Cambridge"},{"key":"5695_CR73","doi-asserted-by":"crossref","unstructured":"Ghafouri S, Khasteh SH (2019) Influence maximization under partially observable environments. In: IEEE 27th Iranian Conference on Electrical Engineering, Yazd, Iran","DOI":"10.1109\/IranianCEE.2019.8786657"},{"key":"5695_CR74","doi-asserted-by":"crossref","unstructured":"Hagberg A, Chult DS, Swart P (2008) Exploring network structure, dynamics, and function using networkX. In: 7th Python in Science Conference","DOI":"10.25080\/TCWV9851"},{"issue":"1","key":"5695_CR75","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.18637\/jss.v024.i01","volume":"24","author":"MS Handcock","year":"2008","unstructured":"Handcock MS, Hunter DR, Butts CT, Goodreau SM, Morris M (2008) Statnet: software tools for the representation, visualization, analysis and simulation of network data. J Stat Softw 24(1):1548","journal-title":"J Stat Softw"},{"issue":"1","key":"5695_CR76","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data 1(1):1\u201341","journal-title":"ACM Trans Knowl Discov Data"},{"key":"5695_CR77","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.socnet.2018.11.003","volume":"59","author":"J Stewart","year":"2019","unstructured":"Stewart J, Schweinberger M, Bojanowski M, Morris M (2019) Multilevel network data facilitate statistical inference for curved ERGMs with geometrically weighted terms. Soc Netw 59:98\u2013119","journal-title":"Soc Netw"},{"key":"5695_CR78","doi-asserted-by":"crossref","unstructured":"Saxena R, Jadeja M, Vyas P (2023) An efficient influence maximization technique based on betweenness centrality measure and clustering coefficient (Bet-Clus). In: 15th International Conference on Computer and Automation Engineering, Sydney, Australia","DOI":"10.1109\/ICCAE56788.2023.10111177"},{"issue":"1","key":"5695_CR79","first-page":"61","volume":"10","author":"M Hosseini-Pozveh","year":"2023","unstructured":"Hosseini-Pozveh M, Shahreza ML (2023) A new PageRank-based method for influence maximization in signed social networks. J Comput Secur 10(1):61\u201374","journal-title":"J Comput Secur"},{"key":"5695_CR80","first-page":"4","volume":"3","author":"J Ou","year":"2022","unstructured":"Ou J, Buskens V, Rijt AVD, Panja D (2022) Influence maximization under limited network information: seeding high-degree neighbors. J Phys Complex 3:4","journal-title":"J Phys Complex"},{"key":"5695_CR81","unstructured":"Bojchevski A, Shchur O, Z\u00fcgner D, G\u00fcnnemann S (2018) NetGAN: generating graphs via random walks. In: 35th International Conference on Machine Learning, Stockholm, Sweden, pp 609\u2013618"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05695-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05695-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05695-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T01:11:47Z","timestamp":1730423507000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05695-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,30]]},"references-count":81,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["5695"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05695-1","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,30]]},"assertion":[{"value":"30 September 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2023","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 interests"}},{"value":"All procedures performed in studies involving human participants were in accordance with the ethical standards of the institutional and national research committee and with the 1964 Helsinki Declaration and its later amendments or comparable ethical standards. This article does not contain any studies with animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}