{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T21:07:09Z","timestamp":1761599229281,"version":"3.37.3"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,1,18]],"date-time":"2022-01-18T00:00:00Z","timestamp":1642464000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,18]],"date-time":"2022-01-18T00:00:00Z","timestamp":1642464000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100005229","name":"Key Science and Technology Foundation of Gansu Province","doi-asserted-by":"publisher","award":["20JR5RA284"],"award-info":[{"award-number":["20JR5RA284"]}],"id":[{"id":"10.13039\/501100005229","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10489-021-02880-8","type":"journal-article","created":{"date-parts":[[2022,1,18]],"date-time":"2022-01-18T00:03:57Z","timestamp":1642464237000},"page":"10829-10844","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Influence maximization based on community structure and second-hop neighborhoods"],"prefix":"10.1007","volume":"52","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0044-0861","authenticated-orcid":false,"given":"Jianjun","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeyi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Handong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenbo","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,18]]},"reference":[{"key":"2880_CR1","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. ACM, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"issue":"6","key":"2880_CR2","doi-asserted-by":"publisher","first-page":"666","DOI":"10.14778\/2735703.2735706","volume":"8","author":"S Chen","year":"2015","unstructured":"Chen S, Fan J, Li G, Feng J, Tan K.l (2015) Online Topic-Aware Influence Maximization. J. Tang, Proc. VLDB Endow. 8(6):666\u2013677. 10.14778\/2735703.2735706","journal-title":"J. Tang, Proc. VLDB Endow."},{"key":"2880_CR3","doi-asserted-by":"crossref","unstructured":"Dong J, Ye F, Chen W, Wu J (2018) Identifying Influential Nodes in Complex Networks via Semi-Local Centrality. In: 2018 IEEE International Symposium on Circuits and Systems (ISCAS). pp 1\u20135","DOI":"10.1109\/ISCAS.2018.8351889"},{"issue":"2","key":"2880_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/2503792.2503797","volume":"42","author":"A Guille","year":"2013","unstructured":"Guille A, Hacid H, Favre C, Zighed DA (2013) Information diffusion in online social networks: A survey. ACM Sigmod Record 42(2):17","journal-title":"ACM Sigmod Record"},{"issue":"1","key":"2880_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1038\/s41467-018-07761-2","volume":"10","author":"A Bovet","year":"2019","unstructured":"Bovet A, Makse HA (2019) Influence of fake news in Twitter during the 2016 US presidential election. Nat. Commun. 10(1):7. https:\/\/doi.org\/10.1038\/s41467-018-07761-2","journal-title":"Nat. Commun."},{"key":"2880_CR6","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (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. ACM, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"2880_CR7","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"2880_CR8","doi-asserted-by":"crossref","unstructured":"Ye M, Liu X, Lee WC (2012) Exploring social influence for recommendation: a generative model approach. In: Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval. ACM, pp 671\u2013680","DOI":"10.1145\/2348283.2348373"},{"key":"2880_CR9","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.chaos.2018.01.013","volume":"107","author":"F Nian","year":"2018","unstructured":"Nian F, Hu C, Yao S, Wang L, Wang X (2018) An immunization based on node activity. Chaos, Solitons & Fractals 107:228. https:\/\/doi.org\/10.1016\/j.chaos.2018.01.013. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0960077918300134","journal-title":"Chaos, Solitons & Fractals"},{"key":"2880_CR10","doi-asserted-by":"publisher","unstructured":"Nian F, Wang X (2010) Efficient immunization strategies on complex networks. https:\/\/doi.org\/10.1016\/j.jtbi.2010.01.007https:\/\/doi.org\/10.1016\/j. https:\/\/doi.org\/10.1016\/j.jtbi.2010.01.007jtbi.2010.01.007. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022519310000111, vol 1, p 77","DOI":"10.1016\/j.jtbi.2010.01.007 10.1016\/j.jtbi.2010.01.007"},{"key":"2880_CR11","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. ACM, pp 665\u2013674","DOI":"10.1145\/1963405.1963499"},{"key":"2880_CR12","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. SIAM, pp 463\u2013474","DOI":"10.1137\/1.9781611972825.40"},{"key":"2880_CR13","doi-asserted-by":"crossref","unstructured":"Huo Z, Huang X, Hu X (2018) Link Prediction With Personalized Social Influence. In: McIlraith SA, Weinberger KQ (eds) Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence,. (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th AAAI Symposium on Educational Advances in Artificial Intelligence (EAAI-18), New Orleans, Louisiana, USA, February 2-7, pp 2289\u20132296. (AAAI Press, 2018) https:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI18\/paper\/view\/16971","DOI":"10.1609\/aaai.v32i1.11892"},{"issue":"1","key":"2880_CR14","doi-asserted-by":"publisher","first-page":"10833","DOI":"10.1038\/s41598-019-47271-9","volume":"9","author":"DA Vega-Oliveros","year":"2019","unstructured":"Vega-Oliveros DA, Zhao L, Berton L (2019) Evaluating link prediction by diffusion processes in dynamic networks. Sci. Rep. 9(1):10833. https:\/\/doi.org\/10.1038\/s41598-019-47271-9","journal-title":"Sci. Rep."},{"key":"2880_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.physa.2014.03.027","volume":"405","author":"Y Cui","year":"2014","unstructured":"Cui Y, Wang X, Li J (2014) Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient. Physica A: Statistical Mechanics and its Applications 405:85. https:\/\/doi.org\/10.1016\/j.physa.2014.03.027https:\/\/doi.org\/10.1016\/j.physa.2014. https:\/\/doi.org\/10.1016\/j.physa.2014.03.02703.027. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0378437114002222https:\/\/www.sciencedirect.com\/science\/article\/pii\/S03784 https:\/\/www.sciencedirect.com\/science\/article\/pii\/S037843711400222237114002222","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"2880_CR16","doi-asserted-by":"publisher","first-page":"2555","DOI":"10.1016\/j.physa.2013.01.039","volume":"10","author":"X Wang","year":"2013","unstructured":"Wang X, Li J (2013) Detecting communities by the core-vertex and intimate degree in complex networks. Physica A: Statistical Mechanics and its Applications, 392 10:2555. https:\/\/doi.org\/10.1016\/j.physa.2013.01.039. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0378437113000915","journal-title":"Physica A: Statistical Mechanics and its Applications, 392"},{"issue":"23","key":"2880_CR17","doi-asserted-by":"publisher","first-page":"6125","DOI":"10.1016\/j.physa.2013.07.066","volume":"392","author":"J Li","year":"2013","unstructured":"Li J, Wang X, Eustace J (2013) Detecting overlapping communities by seed community in weighted complex networks. Physica A: Statistical Mechanics and its Applications 392(23):6125. https:\/\/doi.org\/10.1016\/j.physa.2013.07.066https:\/\/doi.org\/10.1016\/j.phy- https:\/\/doi.org\/10.1016\/j.physa.2013.07.066sa.2013.07.066. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0378437113006973https:\/\/www.sciencedirect.com\/science\/article\/pii\/ https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0378437113006973S0378437113006973","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"issue":"1","key":"2880_CR18","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1186\/s40535-017-0037-2","volume":"4","author":"W Shi","year":"2017","unstructured":"Shi W, Wang CD, Lai JH (2017) Community detection based on influence power. Applied Informatics 4(1):8. https:\/\/doi.org\/10.1186\/s40535-017-0037-2","journal-title":"Applied Informatics"},{"issue":"3","key":"2880_CR19","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s10115-011-0396-2","volume":"30","author":"K Saito","year":"2012","unstructured":"Saito K, Kimura M, Ohara K, Motoda H (2012) Efficient discovery of influential nodes for SIS models in social networks. Knowl. Inf. Syst. 30(3):613. https:\/\/doi.org\/10.1007\/s10115-011-0396-2","journal-title":"Knowl. Inf. Syst."},{"issue":"3","key":"2880_CR20","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1109\/TC.2013.2295802","volume":"64","author":"S Wen","year":"2015","unstructured":"Wen S, Haghighi MS, Chen C, Xiang Y, Zhou W, Jia W (2015) A Sword with Two Edges: Propagation Studies on Both Positive and Negative Information in Online Social Networks. IEEE Trans. Comput. 64(3):640","journal-title":"IEEE Trans. Comput."},{"key":"2880_CR21","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.cnsns.2016.12.019","volume":"48","author":"X Wang","year":"2017","unstructured":"Wang X, Zhao T (2017) Model for multi-messages spreading over complex networks considering the relationship between messages. Communications in Nonlinear Science and Numerical Simulation 48:63. https:\/\/doi.org\/10.1016\/j.cnsns.2016.12.019https:\/\/doi.org\/10.1016\/j. https:\/\/doi.org\/10.1016\/j.cnsns.2016.12.019cnsns.2016.12.019. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1007570416305135https:\/\/www.sciencedirect.com\/science\/article\/ https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1007570416305135pii\/S1007570416305135","journal-title":"Communications in Nonlinear Science and Numerical Simulation"},{"key":"2880_CR22","doi-asserted-by":"publisher","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, KDD \u201910. Association for Computing Machinery, New York, NY, USA, pp 1029\u20131038. https:\/\/doi.org\/10.1145\/1835804.1835934","DOI":"10.1145\/1835804.1835934"},{"key":"2880_CR23","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.physa.2016.12.038","volume":"471","author":"D Li","year":"2017","unstructured":"Li D, Wang X, Huang P (2017) A fractal growth model: Exploring the connection pattern of hubs in complex networks. Physica A: Statistical Mechanics and its Applications 471:200. https:\/\/doi.org\/10.1016\/j.physa.2016.12.038https:\/\/doi.org\/10.1016\/j.physa.20 https:\/\/doi.org\/10.1016\/j.physa.2016.12.03816.12.038. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0378437116310184https:\/\/www.sciencedirect.com\/science\/article\/pii\/S03 https:\/\/www.sciencedirect.com\/science\/article\/pii\/S037843711631018478437116310184","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"2880_CR24","doi-asserted-by":"publisher","unstructured":"Li Y, Chen W, Wang Y, Zhang ZL (2013) Influence Diffusion Dynamics and Influence Maximization in Social Networks with Friend and Foe Relationships. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, WSDM \u201913. Association for Computing Machinery, New York, NY, USA, pp 657\u2013666. https:\/\/doi.org\/10.1145\/2433396.2433478","DOI":"10.1145\/2433396.2433478"},{"key":"2880_CR25","doi-asserted-by":"crossref","unstructured":"Liu B, Cong G, Xu D, Zeng Y (2012) Time Constrained Influence Maximization in Social Networks. In: 2012 IEEE 12th International Conference on Data Mining. pp 439\u2013448","DOI":"10.1109\/ICDM.2012.158"},{"issue":"10","key":"2880_CR26","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 (2018) Influence Maximization on Social Graphs: A Survey. IEEE Trans. Knowl. Data Eng. 30(10):1852","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2880_CR27","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1016\/j.future.2018.07.015","volume":"89","author":"S Bhattacharya","year":"2018","unstructured":"S. N., A. B., Bhattacharya S (2018) Influence maximization in large social networks: Heuristics, models and parameters. Future Generation Computer Systems 89:777. https:\/\/doi.org\/10.1016\/j.future.2018.07.015. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167739X18301092","journal-title":"Future Generation Computer Systems"},{"key":"2880_CR28","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on World wide web. ACM, pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"issue":"10","key":"2880_CR29","doi-asserted-by":"publisher","first-page":"2770","DOI":"10.1109\/TKDE.2015.2419659","volume":"27","author":"C Zhou","year":"2015","unstructured":"Zhou C, Zhang P, Zang W, Guo L (2015) On the Upper Bounds of Spread for Greedy Algorithms in Social Network Influence Maximization. IEEE Trans. Knowl. Data Eng. 27(10): 2770","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2880_CR30","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. ACM, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"2880_CR31","doi-asserted-by":"publisher","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, CIKM \u201913. Association for Computing Machinery, New York, NY, USA, pp 509\u2013518. https:\/\/doi.org\/10.1145\/2505515.2505541","DOI":"10.1145\/2505515.2505541"},{"key":"2880_CR32","doi-asserted-by":"publisher","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. Association for Computing Machinery, New York, NY, USA, pp 1039\u20131048. https:\/\/doi.org\/10.1145\/1835804.1835935","DOI":"10.1145\/1835804.1835935"},{"key":"2880_CR33","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 76:036106. https:\/\/doi.org\/10.1103\/PhysRevE.76.036106","journal-title":"Phys. Rev. E"},{"key":"2880_CR34","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","journal-title":"IEEE Access"},{"key":"2880_CR35","doi-asserted-by":"publisher","unstructured":"Tang J, Qu M, Wang M, Zhang M, Yan J, Mei Q (2015) LINE: Large-Scale Information Network Embedding. In: Proceedings of the 24th International Conference on World Wide Web, WWW \u201915. International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, CHE, pp 1067\u20131077. https:\/\/doi.org\/10.1145\/2736277.2741093","DOI":"10.1145\/2736277.2741093"},{"key":"2880_CR36","doi-asserted-by":"crossref","unstructured":"Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms. SIAM, pp 946\u2013957","DOI":"10.1137\/1.9781611973402.70"},{"key":"2880_CR37","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 2014 ACM SIGMOD international conference on Management of data. ACM, pp 75\u201386","DOI":"10.1145\/2588555.2593670"},{"key":"2880_CR38","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 2015 ACM SIGMOD International Conference on Management of Data. ACM, pp 1539\u20131554","DOI":"10.1145\/2723372.2723734"},{"issue":"4","key":"2880_CR39","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, Yoo M (2017) Probability-based multi-hop diffusion method for influence maximization in social networks. Wirel. Pers. Commun. 93(4):903","journal-title":"Wirel. Pers. Commun."},{"key":"2880_CR40","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab. http:\/\/ilpubs.stanford.edu:8090\/422\/. Previous number = SIDL-WP-1999-0120"},{"issue":"0","key":"2880_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/09540091.2021.1904206","volume":"0","author":"L Qiu","year":"2021","unstructured":"Qiu L, Sai S, Tian X (2021) TsFSIM: a three-step fast selection algorithm for influence maximisation in social network. Connection Science 0(0):1. https:\/\/doi.org\/10.1080\/09540091.2021.1904206","journal-title":"Connection Science"},{"key":"2880_CR42","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","journal-title":"Knowl.-Based Syst."},{"key":"2880_CR43","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.cie.2018.04.049","volume":"120","author":"M Jalayer","year":"2018","unstructured":"Jalayer M, Azheian M, M.A.M.A (2018) A hybrid algorithm based on community detection and multi attribute decision making for influence maximization. Kermani, Computers & Industrial Engineering 120:234","journal-title":"Kermani, Computers & Industrial Engineering"},{"issue":"6","key":"2880_CR44","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(6):2137. https:\/\/doi.org\/10.1007\/s10489-018-1387-8","journal-title":"Appl. Intell."},{"key":"2880_CR45","doi-asserted-by":"publisher","unstructured":"Kumar S, Singhla L, Jindal K, Grover K, Panda BS (2021) IM-ELPR: Influence maximization in social networks using label propagation based community structure. Applied Intelligence, https:\/\/doi.org\/10.1007\/s10489-021-02266-w","DOI":"10.1007\/s10489-021-02266-w"},{"key":"2880_CR46","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: Statistical Mechanics and its Applications 582:126258. https:\/\/doi.org\/10.1016\/j.physa.2021.126258https:\/\/doi.org\/10.10 https:\/\/doi.org\/10.1016\/j.physa.2021.12625816\/j.physa.2021.126258. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0378437121005318","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"issue":"10","key":"2880_CR47","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. Journal of statistical mechanics: theory and experiment 2008(10):P10008","journal-title":"Journal of statistical mechanics: theory and experiment"},{"issue":"1","key":"2880_CR48","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2007","unstructured":"Fortunato S, Barth\u00e9lemy M (2007) Resolution limit in community detection. Proceedings of the National Academy of Sciences 104(1):36. https:\/\/doi.org\/10.1073\/pnas.0605965104https:\/\/doi.org\/10.1073\/pnas. https:\/\/doi.org\/10.1073\/pnas.06059651040605965104. https:\/\/www.pnas.org\/content\/104\/1\/36","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"2880_CR49","doi-asserted-by":"crossref","unstructured":"Newman ME (2004) Fast algorithm for detecting community structure in networks, vol 69, p 2004","DOI":"10.1103\/PhysRevE.69.066133"},{"key":"2880_CR50","doi-asserted-by":"crossref","unstructured":"Newman ME, Girvan M (2004) Finding and evaluating community structure in networks, vol 69, p 2004","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"2880_CR51","unstructured":"Batagelj V, Mrvar A (2006) Pajek datasets. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/"},{"key":"2880_CR52","doi-asserted-by":"publisher","first-page":"065103","DOI":"10.1103\/PhysRevE.68.065103","volume":"68","author":"R Guimer\u00e0","year":"2003","unstructured":"Guimer\u00e0 R, Danon L, D\u00edaz-Guilera A, Giralt F, Arenas A (2003) Self-similar community structure in a network of human interactions. Phys. Rev. E 68:065103. https:\/\/doi.org\/10.1103\/PhysRevE.68.065103","journal-title":"Phys. Rev. E"},{"key":"2880_CR53","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1093\/comnet\/cnab014","volume":"9","author":"B Rozemberczki","year":"2021","unstructured":"Rozemberczki B, Allen C, Sarkar R (2021) Multi-Scale Attributed Node Embedding. Journal of Complex Networks 9:2","journal-title":"Journal of Complex Networks"},{"key":"2880_CR54","doi-asserted-by":"publisher","first-page":"056122","DOI":"10.1103\/PhysRevE.70.056122","volume":"70","author":"M Bogu\u00f1\u00e1","year":"2004","unstructured":"Bogu\u00f1\u00e1 M, Pastor-Satorras R, D\u00edaz-Guilera A, Arenas A (2004) Models of social networks based on social distance attachment. Phys. Rev. E 70:056122. https:\/\/doi.org\/10.1103\/PhysRevE.70.056122https:\/\/doi.org\/10.1103\/PhysRevE.70.05 https:\/\/doi.org\/10.1103\/PhysRevE.70.0561226122","journal-title":"Phys. Rev. E"},{"key":"2880_CR55","doi-asserted-by":"crossref","unstructured":"Rozemberczki B, Davies R, Sarkar R, Sutton C (2019) GEMSEC: Graph Embedding with Self Clustering. In: Proceedings of the 2019 IEEE\/ACM international conference on advances in social networks analysis and mining 2019. ACM, pp 65\u201372","DOI":"10.1145\/3341161.3342890"},{"key":"2880_CR56","doi-asserted-by":"publisher","unstructured":"Yang J, Leskovec J (2012) Defining and Evaluating Network Communities Based on Ground-Truth. In: 2013 IEEE 13th international conference on data mining. IEEE Computer Society, Los Alamitos, pp 745\u2013754. https:\/\/doi.org\/10.1109\/ICDM.2012.138","DOI":"10.1109\/ICDM.2012.138"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02880-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02880-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02880-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T05:07:08Z","timestamp":1656392828000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02880-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,18]]},"references-count":56,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["2880"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02880-8","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2022,1,18]]},"assertion":[{"value":"28 September 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}