{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T11:20:21Z","timestamp":1771068021550,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,9,12]],"date-time":"2016-09-12T00:00:00Z","timestamp":1473638400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61202390"],"award-info":[{"award-number":["61202390"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s00500-016-2335-3","type":"journal-article","created":{"date-parts":[[2016,9,11]],"date-time":"2016-09-11T21:03:41Z","timestamp":1473627821000},"page":"453-464","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":53,"title":["Identifying opinion leader nodes in online social networks with a new closeness evaluation algorithm"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2750-7031","authenticated-orcid":false,"given":"Li","family":"Yang","sequence":"first","affiliation":[]},{"given":"Yafeng","family":"Qiao","sequence":"additional","affiliation":[]},{"given":"Zhihong","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jianfeng","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Xinghua","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,12]]},"reference":[{"key":"2335_CR1","doi-asserted-by":"crossref","unstructured":"Bader DA, Kintali S, Madduri K, Mihail M (2007) Approximating betweenness centrality. In: Bonato A, Chung FRK (eds) Algorithms and models for the web-graph. Springer, San Diego, pp 124\u2013137","DOI":"10.1007\/978-3-540-77004-6_10"},{"key":"2335_CR2","doi-asserted-by":"crossref","unstructured":"Bakshy E, Karrer B, Adamic LA (2009) Social influence and the diffusion of user-created content. In: Proceedings of the 10th ACM conference on electronic commerce, ACM, pp 325\u2013334","DOI":"10.1145\/1566374.1566421"},{"issue":"4","key":"2335_CR3","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/j.socnet.2007.04.002","volume":"29","author":"P Bonacich","year":"2007","unstructured":"Bonacich P (2007) Some unique properties of eigenvector centrality. Social Netw 29(4):555\u2013564","journal-title":"Social Netw"},{"issue":"2","key":"2335_CR4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes U (2001) A faster algorithm for betweenness centrality*. J Math Sociol 25(2):163\u2013177","journal-title":"J Math Sociol"},{"issue":"2","key":"2335_CR5","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.socnet.2007.11.001","volume":"30","author":"U Brandes","year":"2008","unstructured":"Brandes U (2008) On variants of shortest-path betweenness centrality and their generic computation. Social Netw 30(2):136\u2013145","journal-title":"Social Netw"},{"issue":"1","key":"2335_CR6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s13278-012-0060-1","volume":"3","author":"S Catanese","year":"2013","unstructured":"Catanese S, Ferrara E, Fiumara G (2013) Forensic analysis of phone call networks. Social Netw Anal Min 3(1):15\u201333","journal-title":"Social Netw Anal Min"},{"key":"2335_CR7","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"},{"key":"2335_CR8","doi-asserted-by":"crossref","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35\u201341","DOI":"10.2307\/3033543"},{"issue":"3","key":"2335_CR9","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman LC (1978) Centrality in social networks conceptual clarification. Social Netw 1(3):215\u2013239","journal-title":"Social Netw"},{"issue":"1","key":"2335_CR10","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1109\/TCE.2014.6780939","volume":"60","author":"Z Fu","year":"2014","unstructured":"Fu Z, Sun X, Linge N, Zhou L (2014) Achieving effective cloud search services: multi-keyword ranked search over encrypted cloud data supporting synonym query. IEEE Trans Consum Electron 60(1):164\u2013172","journal-title":"IEEE Trans Consum Electron"},{"key":"2335_CR11","doi-asserted-by":"crossref","unstructured":"Fu Z, Ren K, Shu J, Sun X (2016) Enabling personalized search over encrypted outsourced data with efficiency improvement. IEEE Trans Parallel Distrib Syst 27(9):2546\u20132559","DOI":"10.1109\/TPDS.2015.2506573"},{"key":"2335_CR12","doi-asserted-by":"crossref","unstructured":"Granovetter MS (1973) The strength of weak ties. Am J Sociol 78(6):1360\u20131380","DOI":"10.1086\/225469"},{"issue":"6","key":"2335_CR13","first-page":"929","volume":"15","author":"P Guo","year":"2014","unstructured":"Guo P, Wang J, Geng XH, Kim CS, Kim JU (2014) A variable threshold-value authentication architecture for wireless mesh networks. J Internet Technol 15(6):929\u2013935","journal-title":"J Internet Technol"},{"issue":"5","key":"2335_CR14","doi-asserted-by":"crossref","first-page":"056,109","DOI":"10.1103\/PhysRevE.65.056109","volume":"65","author":"P Holme","year":"2002","unstructured":"Holme P, Kim BJ, Yoon CN, Han SK (2002) Attack vulnerability of complex networks. Phys Rev E 65(5):056,109","journal-title":"Phys Rev E"},{"key":"2335_CR15","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"},{"issue":"11","key":"2335_CR16","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak M, Gallos LK, Havlin S, Liljeros F, Muchnik L, Stanley HE, Makse HA (2010) Identification of influential spreaders in complex networks. Nat Phys 6(11):888\u2013893","journal-title":"Nat Phys"},{"issue":"6","key":"2335_CR17","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1109\/TPDS.2013.284","volume":"25","author":"J Li","year":"2013","unstructured":"Li J, Chen X, Li M, Li J, Lee PPC, Lou W (2013) Secure deduplication with efficient and reliable convergent key management. IEEE Trans Parallel Distrib Syst 25(6):1615\u20131625","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"8","key":"2335_CR18","doi-asserted-by":"crossref","first-page":"2201","DOI":"10.1109\/TPDS.2013.271","volume":"25","author":"J Li","year":"2014","unstructured":"Li J, Huang X, Li J, Chen X (2014) Securely outsourcing attribute-based encryption with checkability. IEEE Trans Parallel Distrib Syst 25(8):2201\u20132210","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"2335_CR19","doi-asserted-by":"crossref","unstructured":"Li J, Li J, Chen X, Jia C, Lou W (2015) Identity-based encryption with outsourced revocation in cloud computing. IEEE Trans Comput 64(2):425\u2013437","DOI":"10.1109\/TC.2013.208"},{"issue":"1","key":"2335_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s40649-014-0001-4","volume":"1","author":"Z Lu","year":"2014","unstructured":"Lu Z, Fan L, Wu W, Thuraisingham B, Yang K (2014) Efficient influence spread estimation for influence maximization under the linear threshold model. Comput Soc Netw 1(1):1\u201319","journal-title":"Comput Soc Netw"},{"issue":"4","key":"2335_CR21","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/S0375-9601(99)00757-4","volume":"263","author":"ME Newman","year":"1999","unstructured":"Newman ME, Watts DJ (1999) Renormalization group analysis of the small-world network model. Phys Lett A 263(4):341\u2013346","journal-title":"Phys Lett A"},{"issue":"18","key":"2335_CR22","doi-asserted-by":"crossref","first-page":"7332","DOI":"10.1073\/pnas.0610245104","volume":"104","author":"JP Onnela","year":"2007","unstructured":"Onnela JP, Saram\u00e4ki J, Hyv\u00f6nen J, Szab\u00f3 G, Lazer D, Kaski K, Kert\u00e9sz J, Barab\u00e1si AL (2007) Structure and tie strengths in mobile communication networks. Proc Natl Acad Sci 104(18):7332\u20137336","journal-title":"Proc Natl Acad Sci"},{"key":"2335_CR23","unstructured":"Putzke J, Takeda H (2016) Identifying key opinion leaders in evolving co-authorship networksa descriptive study of a proxy variable for betweenness centrality. In: Cherifi H, Gon\u00e7alves B, Menezes R, Sinatra R (eds) Complex networks, vol VII. Springer, Switzerland, pp 311\u2013323"},{"key":"2335_CR24","doi-asserted-by":"publisher","unstructured":"Qin Y, Ma J, Gao S (2016) Efficient influence maximization under TSCM: a suitable diffusion model in online social networks. Soft Comput 1\u201312. doi:\n                        10.1007\/s00500-016-2068-3","DOI":"10.1007\/s00500-016-2068-3"},{"key":"2335_CR25","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, ACM, pp 61\u201370","DOI":"10.1145\/775047.775057"},{"issue":"4","key":"2335_CR26","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/BF02289527","volume":"31","author":"G Sabidussi","year":"1966","unstructured":"Sabidussi G (1966) The centrality index of a graph. Psychometrika 31(4):581\u2013603","journal-title":"Psychometrika"},{"issue":"4","key":"2335_CR27","doi-asserted-by":"crossref","first-page":"2177","DOI":"10.1016\/j.csda.2007.07.021","volume":"52","author":"YH Said","year":"2008","unstructured":"Said YH, Wegman EJ, Sharabati WK, Rigsby JT (2008) Retracted: social networks of author-coauthor relationships. Comput Stat Data Anal 52(4):2177\u20132184","journal-title":"Comput Stat Data Anal"},{"key":"2335_CR28","doi-asserted-by":"crossref","unstructured":"Saito K, Nakano R, Kimura M (2008) Prediction of information diffusion probabilities for independent cascade model. In: Lovrek I, Howlett RJ, Jain LC (eds) Knowledge-based intelligent information and engineering systems. Springer, Croatia, pp 67\u201375","DOI":"10.1007\/978-3-540-85567-5_9"},{"key":"2335_CR29","doi-asserted-by":"crossref","unstructured":"Segarra S, Ribeiro A (2014) A stable betweenness centrality measure in networks. In: 2014 IEEE international conference on acoustics, speech and signal processing (ICASSP). IEEE, pp 3859\u20133863","DOI":"10.1109\/ICASSP.2014.6854324"},{"issue":"1","key":"2335_CR30","first-page":"171","volume":"16","author":"J Shen","year":"2015","unstructured":"Shen J, Tan H, Wang J, Wang J, Lee S (2015) A novel routing protocol providing good transmission reliability in underwater sensor networks. J Internet Technol 16(1):171\u2013178","journal-title":"J Internet Technol"},{"key":"2335_CR31","doi-asserted-by":"publisher","unstructured":"Wang M, Ma J (2015) A novel recommendation approach based on users weighted trust relations and the rating similarities. Soft Comput 1\u201310. doi:\n                        10.1007\/s00500-015-1734-1","DOI":"10.1007\/s00500-015-1734-1"},{"issue":"6684","key":"2335_CR32","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of small-world networks. Nature 393(6684):440\u2013442","journal-title":"Nature"},{"issue":"2","key":"2335_CR33","first-page":"1","volume":"27","author":"Z Xia","year":"2015","unstructured":"Xia Z, Wang X, Sun X, Wang Q (2015) A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans Parallel Distrib Syst 27(2):1\u20131","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"4","key":"2335_CR34","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1007\/s13278-012-0078-4","volume":"3","author":"Z Zhang","year":"2013","unstructured":"Zhang Z, Wang K (2013) A trust model for multimedia social networks. Social Netw Anal Min 3(4):969\u2013979","journal-title":"Social Netw Anal Min"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2335-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2335-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2335-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,20]],"date-time":"2018-01-20T01:36:48Z","timestamp":1516412208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2335-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,12]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["2335"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2335-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,12]]}}}