{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T04:52:47Z","timestamp":1771563167079,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T00:00:00Z","timestamp":1635984000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T00:00:00Z","timestamp":1635984000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Nature Science Foundation of China","award":["No. 61502281, 71772107"],"award-info":[{"award-number":["No. 61502281, 71772107"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s10489-021-02818-0","type":"journal-article","created":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T21:02:35Z","timestamp":1636059755000},"page":"8721-8734","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Multi-hop analysis method for rich-club phenomenon of influence maximization in social networks"],"prefix":"10.1007","volume":"52","author":[{"given":"Xiuliang","family":"Duan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4731-8561","authenticated-orcid":false,"given":"Liqing","family":"Qiu","sequence":"additional","affiliation":[]},{"given":"Chengai","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Qiang","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,4]]},"reference":[{"key":"2818_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 (KDD '01). Association for Computing Machinery, New York, NY, USA, 57\u201366","DOI":"10.1145\/502512.502525"},{"key":"2818_CR2","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining (KDD '02). Association for Computing Machinery, New York, NY, USA, 61\u201370","DOI":"10.1145\/775047.775057"},{"key":"2818_CR3","doi-asserted-by":"crossref","unstructured":"Tardos E, Kempe D, Kleinberg J (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 (KDD '03). Association for Computing Machinery, New York, NY, USA, 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"2818_CR4","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 (KDD '09). Association for Computing Machinery, New York, NY, USA, 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"2818_CR5","doi-asserted-by":"crossref","unstructured":"Leskovec J (2005) The dynamics of viral marketing. ACM Trans. Web 1, 1 (May 2007), 5\u2013es","DOI":"10.1145\/1232722.1232727"},{"key":"2818_CR6","doi-asserted-by":"crossref","unstructured":"Cha M, Mislove A, Krishna P (2009) A measurement-driven analysis of information propagation in the flickr social network. In Proceedings of the 18th international conference on World wide web (WWW '09). Association for Computing Machinery, New York, NY, USA, 721\u2013730","DOI":"10.1145\/1526709.1526806"},{"key":"2818_CR7","doi-asserted-by":"crossref","unstructured":"Goel S, Watts DJ, Goldstein DG. (2012). The structure of online diffusion networks. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC '12). Association for Computing Machinery, New York, NY, USA, 623\u2013638","DOI":"10.1145\/2229012.2229058"},{"issue":"1","key":"2818_CR8","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":"2818_CR9","unstructured":"Vespignani A (2005) Evolution and structure of the internet: a statistical physics approach. Cambridge Univeristy Press,\u00a0Cambridge"},{"key":"2818_CR10","doi-asserted-by":"crossref","unstructured":"AraI, S, Muchnik, L, Arun S (2009) Distinguishing influence-based contagion from homophily-driven diffusion in dynamic networks. Proceedings of the National Academy of Sciences 106(51):21544\u201321549","DOI":"10.1073\/pnas.0908800106"},{"key":"2818_CR11","doi-asserted-by":"crossref","unstructured":"Wasserman S, Faust KD (1994) Social network analysis: methods and applications (Structural Analysis in the social sciences). Cambridge University Press,\u00a0Cambridge","DOI":"10.1017\/CBO9780511815478"},{"issue":"3","key":"2818_CR12","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1109\/LCOMM.2004.823426","volume":"8","author":"S Zhou","year":"2004","unstructured":"Zhou S, Mondragon RJ (2004) The rich-club phenomenon in the internet topology. IEEE Commun Lett 8(3):180\u2013182","journal-title":"IEEE Commun Lett"},{"key":"2818_CR13","doi-asserted-by":"crossref","unstructured":"Aghaee Z, Beni HA, Kianian S, Vahidipour M (2020) A Heuristic Algorithm Focusing on the Rich-Club Phenomenon for the Influence Maximization Problem in Social Networks. In 2020 6th International Conference on Web Research (ICWR) (pp. 119\u2013125). IEEE","DOI":"10.1109\/ICWR49608.2020.9122321"},{"key":"2818_CR14","doi-asserted-by":"crossref","unstructured":"Zhang Z, Hou R, & Yang J (2020) Detection of Social Network Spam Based on Improved Extreme Learning Machine. IEEE Access 8:112003\u2013112014","DOI":"10.1109\/ACCESS.2020.3002940"},{"key":"2818_CR15","unstructured":"Zheng C, Han Q, & Wang H (2015) How do paid posters\u2019 comments affect your purchase intention. Nankai Business Review 18:89\u201397"},{"key":"2818_CR16","doi-asserted-by":"crossref","unstructured":"Beni HA, & Bouyer A (2020) TI-SC: top-k influential nodes selection based on community detection and scoring criteria in social networks. Journal of Ambient Intelligence and Humanized Computing, 1\u201320","DOI":"10.1007\/s12652-020-01760-2"},{"issue":"9","key":"2818_CR17","doi-asserted-by":"publisher","first-page":"5766","DOI":"10.1073\/pnas.082090499","volume":"99","author":"DJ Watts","year":"2002","unstructured":"Watts DJ (2002) A simple model of global cascades on random networks. Proc Natl Acad Sci USA 99(9):5766\u20135771","journal-title":"Proc Natl Acad Sci USA"},{"key":"2818_CR18","doi-asserted-by":"crossref","unstructured":"Tong G, Wu W, Tang S, Du DZ (2016) Adaptive influence maximization in dynamic social networks. IEEE\/ACM Transactions on Networking 25(1):112\u2013125","DOI":"10.1109\/TNET.2016.2563397"},{"key":"2818_CR19","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 (pp. 1539\u20131554)","DOI":"10.1145\/2723372.2723734"},{"issue":"4","key":"2818_CR20","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\u2013916","journal-title":"Wirel Pers Commun"},{"key":"2818_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 (pp. 1029\u20131038)","DOI":"10.1145\/1835804.1835934"},{"key":"2818_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.eswa.2019.01.070","volume":"125","author":"A Sb","year":"2019","unstructured":"Sb A, Mj A, Dkp B (2019) Combim: a community-based solution approach for the budgeted influence maximization problem - sciencedirect. Expert Syst Appl 125:1\u201313","journal-title":"Expert Syst Appl"},{"key":"2818_CR23","first-page":"338","volume":"354","author":"Q He","year":"2019","unstructured":"He Q, Wang X, Lei Z, Huang M, Cai Y, Ma L (2019) Tifim: a two-stage iterative framework for influence maximization in social networks. Appl Math Comput 354:338\u2013352","journal-title":"Appl Math Comput"},{"key":"2818_CR24","doi-asserted-by":"crossref","unstructured":"Li W, Li Z, Luvembe AM, & Yang C (2021) Influence maximization algorithm based on Gaussian propagation model. Information Sciences 568:386-402","DOI":"10.1016\/j.ins.2021.04.061"},{"key":"2818_CR25","doi-asserted-by":"publisher","first-page":"105606","DOI":"10.1016\/j.asoc.2019.105606","volume":"83","author":"L Ma","year":"2019","unstructured":"Ma L, Liu Y (2019) Maximizing three-hop influence spread in social networks using discrete comprehensive learning artificial bee colony optimizer. Appl Soft Comput 83:105606","journal-title":"Appl Soft Comput"},{"issue":"2","key":"2818_CR26","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1007\/s11280-019-00750-5","volume":"23","author":"W Li","year":"2020","unstructured":"Li W, Fan Y, Mo J, Liu W, Wang C, Xin M et al (2020)Three-hop velocity attenuation propagation model for influence maximization in social networks. World Wide Web 23(2):1261\u20131273","journal-title":"World Wide Web"},{"key":"2818_CR27","doi-asserted-by":"crossref","unstructured":"Engelhardt F, & G\u00fcne\u015f M (2019) Modeling delay of haptic data in CSMA-based wireless multi-hop networks: A probabilistic approach. In 2019 IEEE 30th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC Workshops) (pp. 1\u20136). IEEE","DOI":"10.1109\/PIMRCW.2019.8880820"},{"issue":"3","key":"2818_CR28","first-page":"57","volume":"12","author":"YE Assari","year":"2020","unstructured":"Assari YE, Fallah SA, Aasri JE, Arioua M, Oualkadi AE (2020)Energy-efficient multi-hop routing with unequal clustering approach for wireless sensor networks. Int J Comput Netw Commun Secur 12(3):57\u201375","journal-title":"Int J Comput Netw Commun Secur"},{"key":"2818_CR29","doi-asserted-by":"crossref","unstructured":"Adineh M, & Nouri-Baygi M (2018) Maximum degree based heuristics for influence maximization. In 2018 8th International Conference on Computer and Knowledge Engineering (ICCKE) (pp. 256\u2013261). IEEE","DOI":"10.1109\/ICCKE.2018.8566515"},{"key":"2818_CR30","doi-asserted-by":"publisher","first-page":"106115","DOI":"10.1016\/j.asoc.2020.106115","volume":"89","author":"F Fanian","year":"2020","unstructured":"Fanian F, Rafsanjani MK (2020) A new fuzzy multi-hop clustering protocol with automatic rule tuning for wireless sensor networks. Appl Soft Comput 89:106115","journal-title":"Appl Soft Comput"},{"issue":"4","key":"2818_CR31","doi-asserted-by":"publisher","first-page":"332","DOI":"10.12720\/jcm.15.4.332-344","volume":"15","author":"SA Rashid","year":"2020","unstructured":"Rashid SA, Audah L, Hamdi MM, Alani S (2020) Prediction based efficient multi-hop clustering approach with adaptive relay node selection for vanet. J Commun 15(4):332\u2013344","journal-title":"J Commun"},{"key":"2818_CR32","doi-asserted-by":"publisher","first-page":"106561","DOI":"10.1016\/j.knosys.2020.106561","volume":"211","author":"C Qi","year":"2021","unstructured":"Qi C, Zhang J, Jia H, Mao Q, Song H (2021) Deep face clustering using residual graph convolutional network. Knowl-Based Syst 211:106561","journal-title":"Knowl-Based Syst"},{"key":"2818_CR33","doi-asserted-by":"crossref","unstructured":"Adineh M, & Nouri-Baygi M (2019) High Quality Degree Based Heuristics for the Influence Maximization Problem. arXiv preprint arXiv:1904.12164","DOI":"10.1109\/ICCKE.2018.8566515"},{"key":"2818_CR34","doi-asserted-by":"crossref","unstructured":"Colizza V, Flammini A, Serrano MA, & Vespignani A (2006) Detecting rich-club ordering in complex networks. Nature physics 2(2):110\u2013115","DOI":"10.1038\/nphys209"},{"issue":"4","key":"2818_CR35","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.socnet.2005.07.005","volume":"28","author":"N Masuda","year":"2012","unstructured":"Masuda N, Konno N (2012)Vip-club phenomenon: emergence of elites and masterminds in social networks. Soc Networks 28(4):297\u2013309","journal-title":"Soc Networks"},{"key":"2818_CR36","doi-asserted-by":"crossref","unstructured":"He R, Zhao J, & Xu K (2012)Rich-Club Connectivity in Large-Scale Complex Networks. In 2012 Second International Conference on Cloud and Green Computing (pp. 730\u2013735). IEEE","DOI":"10.1109\/CGC.2012.103"},{"key":"2818_CR37","doi-asserted-by":"crossref","unstructured":"Dong Y, Tang J, Chawla NV, Lou T, Yang Y, & Wang B (2015) Inferring social status and rich club effects in enterprise communication networks. PloS one 10(3):e0119446","DOI":"10.1371\/journal.pone.0119446"},{"key":"2818_CR38","doi-asserted-by":"crossref","unstructured":"Aghaee Z, & Kianian S (2020) Influence maximization algorithm based on reducing search space in the social networks. SN Applied Sciences 2(12):1\u201314","DOI":"10.1007\/s42452-020-03812-w"},{"key":"2818_CR39","doi-asserted-by":"publisher","first-page":"956","DOI":"10.3389\/fneur.2019.00956","volume":"10","author":"MD Schirmer","year":"2019","unstructured":"Schirmer MD, Ktena SI, Nardin MJ, Donahue KL, Rost NS (2019)Rich-club organization: an important determinant of functional outcome after acute ischemic stroke. Front Neurol 10:956","journal-title":"Front Neurol"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02818-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02818-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02818-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T09:15:25Z","timestamp":1653902125000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02818-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,4]]},"references-count":39,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["2818"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02818-0","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,4]]},"assertion":[{"value":"3 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}