{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T03:26:43Z","timestamp":1761017203892,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319723945"},{"type":"electronic","value":"9783319723952"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72395-2_38","type":"book-chapter","created":{"date-parts":[[2017,12,8]],"date-time":"2017-12-08T04:56:41Z","timestamp":1512709001000},"page":"415-423","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Comparison of Different Centrality Measures to Find Influential Nodes in Complex Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5358-8771","authenticated-orcid":false,"given":"Fanpeng","family":"Meng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3776-8526","authenticated-orcid":false,"given":"Yijun","family":"Gu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9098-0193","authenticated-orcid":false,"given":"Shunshun","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Mengdi","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yuchen","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,9]]},"reference":[{"issue":"11","key":"38_CR1","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak, M., Gallos, L.K., Havlin, S., Liljeros, F., Muchnik, L., Stanley, H.E., Makse, H.A.: Identification of influential spreaders in complex networks. Nat. Phys. 6(11), 888\u2013893 (2010)","journal-title":"Nat. Phys."},{"issue":"17","key":"38_CR2","first-page":"107","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a largescale hypertextual web search engine. Int. Conf. World Wide Web 30(17), 107\u2013117 (1998)","journal-title":"Int. Conf. World Wide Web"},{"issue":"4","key":"38_CR3","doi-asserted-by":"crossref","first-page":"1777","DOI":"10.1016\/j.physa.2011.09.017","volume":"391","author":"DB Chen","year":"2012","unstructured":"Chen, D.B., L\u00fc, L.Y., Shang, M.S., et al.: Identifying influential nodes in complex networks. Phys. A Stat. Mech. Appl. 391(4), 1777\u20131787 (2012)","journal-title":"Phys. A Stat. Mech. Appl."},{"issue":"6","key":"38_CR4","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.physa.2014.02.032","volume":"403","author":"S Gao","year":"2014","unstructured":"Gao, S., Ma, J., Chen, Z.M., et al.: Ranking the spreading ability of nodes in complex networks based on local structure. Phys. A Stat. Mech. Appl. 403(6), 130\u2013147 (2014)","journal-title":"Phys. A Stat. Mech. Appl."},{"issue":"2","key":"38_CR5","first-page":"21","volume":"8","author":"JJ Cheng","year":"2016","unstructured":"Cheng, J.J., Zhang, Y.C., Zhou, X., et al.: Extracting influential nodes in social networks on local weight aspect. Int. J. Interdisc. Telecommun. Netw. 8(2), 21\u201335 (2016)","journal-title":"Int. J. Interdisc. Telecommun. Netw."},{"issue":"3","key":"38_CR6","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s11859-016-1170-9","volume":"21","author":"W Zhang","year":"2016","unstructured":"Zhang, W., Xu, J., Li, Y.: A new method for identifying influential nodes and important edges in complex networks. Wuhan Univ. J. Nat. Sci. 21(3), 267\u2013276 (2016)","journal-title":"Wuhan Univ. J. Nat. Sci."},{"key":"38_CR7","unstructured":"Han, Z., Chen, Y., Liu, W. et al.: Social network node influence measuring method based on triangle structures. CN 105719190 A (2016)"},{"issue":"2","key":"38_CR8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.3390\/ijgi6020035","volume":"6","author":"X Zhao","year":"2017","unstructured":"Zhao, X., Liu, F., Wang, J., Li, T.: Evaluating influential nodes in social networks by local centrality with a coefficient. ISPRS Int. J. Geo-Inf. 6(2), 35 (2017)","journal-title":"ISPRS Int. J. Geo-Inf."},{"key":"38_CR9","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-981-10-3153-3_32","volume-title":"Proceedings of the 5th International Conference on Frontiers in Intelligent Computing: Theory and Applications","author":"C Saxena","year":"2017","unstructured":"Saxena, C., Doja, M.N., Ahmad, T.: Neighborhood topology to discover influential nodes in a complex Network. In: Satapathy, S.C., Bhateja, V., Udgata, Siba K., Pattnaik, P.K. (eds.) Proceedings of the 5th International Conference on Frontiers in Intelligent Computing: Theory and Applications. AISC, vol. 515, pp. 323\u2013332. Springer, Singapore (2017). \nhttps:\/\/doi.org\/10.1007\/978-981-10-3153-3_32"},{"issue":"4","key":"38_CR10","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.physa.2013.12.031","volume":"399","author":"Y Du","year":"2014","unstructured":"Du, Y., et al.: A new method of identifying influential nodes in complex networks based on TOPSIS. Phys. A Stat. Mech. Appl. 399(4), 57\u201369 (2014)","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"38_CR11","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.physa.2015.09.028","volume":"444","author":"J Hu","year":"2016","unstructured":"Hu, J., et al.: A modified weighted TOPSIS to identify influential nodes in complex networks. Phys. A Stat. Mech. Appl. 444, 73\u201385 (2016)","journal-title":"Phys. A Stat. Mech. Appl."},{"issue":"4","key":"38_CR12","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/j.physa.2017.02.085","volume":"479","author":"T Bian","year":"2017","unstructured":"Bian, T., Hu, J., Deng, Y.: Identifying influential nodes in complex networks based on AHP. Phys. A Stat. Mech. Appl. 479(4), 422\u2013436 (2017)","journal-title":"Phys. A Stat. Mech. Appl."},{"issue":"5","key":"38_CR13","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1016\/j.ipm.2016.04.001","volume":"52","author":"Y Yang","year":"2016","unstructured":"Yang, Y., Xie, G.: Efficient identification of node importance in social networks. Inf. Process. Manag. 52(5), 911\u2013922 (2016). Pergamon Press, Inc","journal-title":"Inf. Process. Manag."},{"issue":"1","key":"38_CR14","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman, L.C.: A set of measures of centrality based upon betweenness. Sociometry 40(1), 35\u201341 (1977)","journal-title":"Sociometry"},{"issue":"2","key":"38_CR15","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25(2), 163\u2013177 (2001)","journal-title":"J. Math. Sociol."},{"issue":"4","key":"38_CR16","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33(4), 452\u2013473 (1977)","journal-title":"J. Anthropol. Res."},{"issue":"04","key":"38_CR17","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1142\/S0219525903001067","volume":"06","author":"PM Gleiser","year":"2003","unstructured":"Gleiser, P.M., Danon, L.: Community structure in jazz. Adv. Complex Syst. 06(04), 565\u2013573 (2003)","journal-title":"Adv. Complex Syst."},{"issue":"3 pt 2","key":"38_CR18","doi-asserted-by":"crossref","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"MEJ Newman","year":"2006","unstructured":"Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E: Stat. Nonlin. Soft Matter Phys. 74(3 pt 2), 036104 (2006)","journal-title":"Phys. Rev. E: Stat. Nonlin. Soft Matter Phys."},{"key":"38_CR19","unstructured":"Mcauley, J., Leskovec, J.: Learning to discover social circles in ego networks. In: Advances in Neural Information Processing Systems, pp. 539\u2013547 (2012)"},{"issue":"6 Pt 2","key":"38_CR20","doi-asserted-by":"crossref","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.: Self-similar community structure in a network of human interactions. Phys. Rev. E: Stat. Nonlin. Soft Matter Phys. 68(6 Pt 2), 065103 (2003)","journal-title":"Phys. Rev. E: Stat. Nonlin. Soft Matter Phys."},{"key":"38_CR21","unstructured":"Xie, N.: Social Network Analysis of Blogs. University of Bristol, Bristol (2006)"},{"issue":"1","key":"38_CR22","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data 1(1), 2 (2007)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"2","key":"38_CR23","doi-asserted-by":"crossref","first-page":"056122","DOI":"10.1103\/PhysRevE.70.056122","volume":"70","author":"M Bogu\u00f1\u00e1","year":"2004","unstructured":"Bogu\u00f1\u00e1, M., et al.: Models of social networks based on social distance attachment. Phys. Rev. E: Stat. Nonlin. Soft Matter Phys. 70(2), 056122 (2004)","journal-title":"Phys. Rev. E: Stat. Nonlin. Soft Matter Phys."},{"key":"38_CR24","doi-asserted-by":"crossref","unstructured":"Hopcroft, J., Lou, T., Tang, J.: Who will follow you back?: reciprocal relationship prediction. In: ACM Conference on Information and Knowledge Management, CIKM 2011, Glasgow, UK, pp. 1137\u20131146. ACM, October 2011","DOI":"10.1145\/2063576.2063740"},{"key":"38_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-39718-2_23","volume-title":"The Semantic Web - ISWC 2003","author":"M Richardson","year":"2003","unstructured":"Richardson, M., Agrawal, R., Domingos, P.: Trust management for the semantic web. In: Fensel, D., Sycara, K., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol. 2870, pp. 351\u2013368. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/978-3-540-39718-2_23"},{"issue":"1","key":"38_CR26","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., et al.: Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math. 6(1), 29\u2013123 (2009)","journal-title":"Internet Math."},{"key":"38_CR27","doi-asserted-by":"crossref","unstructured":"Shu, P., Wang, W., Tang, M., et al.: Numerical identification of epidemic thresholds for susceptible-infected-recovered model on finite-size networks. Chaos 25(6) (2015)","DOI":"10.1063\/1.4922153"},{"key":"38_CR28","doi-asserted-by":"crossref","first-page":"10168","DOI":"10.1038\/ncomms10168","volume":"7","author":"L L\u00fc","year":"2016","unstructured":"L\u00fc, L., et al.: The H-index of a network node and its relation to degree and coreness. Nat. Commun. 7, 10168 (2016)","journal-title":"Nat. Commun."},{"issue":"4","key":"38_CR29","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1103\/RevModPhys.80.1275","volume":"80","author":"SN Dorogovtsev","year":"2007","unstructured":"Dorogovtsev, S.N., Goltsev, A.V., Mendes, J.F.: Critical phenomena in complex networks. Rev. Mod. Phys. 80(4), 1275\u20131335 (2007)","journal-title":"Rev. Mod. Phys."},{"key":"38_CR30","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"M Newman","year":"2010","unstructured":"Newman, M.: Networks: An Introduction. OUP Oxford, Oxford (2010). vol. 327, no. 8, pp. 741\u2013743"},{"issue":"1\/2","key":"38_CR31","doi-asserted-by":"crossref","first-page":"81","DOI":"10.2307\/2332226","volume":"30","author":"MG Kendall","year":"1938","unstructured":"Kendall, M.G.: A new measure of rank correlation. Biometrika 30(1\/2), 81\u201393 (1938)","journal-title":"Biometrika"}],"container-title":["Lecture Notes in Computer Science","Security, Privacy, and Anonymity in Computation, Communication, and Storage"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72395-2_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,11]],"date-time":"2017-12-11T04:18:19Z","timestamp":1512965899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72395-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319723945","9783319723952"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72395-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}