{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T09:32:39Z","timestamp":1775381559115,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T00:00:00Z","timestamp":1496102400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T00:00:00Z","timestamp":1496102400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["123456"],"award-info":[{"award-number":["123456"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1186\/s40537-017-0076-5","type":"journal-article","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T14:37:59Z","timestamp":1496155079000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":85,"title":["Identification of top-K nodes in large networks using Katz centrality"],"prefix":"10.1186","volume":"4","author":[{"given":"Justin","family":"Zhan","sequence":"first","affiliation":[]},{"given":"Sweta","family":"Gurung","sequence":"additional","affiliation":[]},{"given":"Sai Phani Krishna","family":"Parsa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,30]]},"reference":[{"key":"76_CR1","volume-title":"Introduction to social network methods","author":"RA Hanneman","year":"2015","unstructured":"Hanneman RA, Riddle M. Introduction to social network methods. Riverside: Department of Sociology, University of California; 2015."},{"key":"76_CR2","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: an introduction","author":"MEJ Newman","year":"2010","unstructured":"Newman MEJ. Networks: an introduction. Oxford: OUP Oxford; 2010."},{"key":"76_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139088510","volume-title":"Social media mining: an introduction","author":"R Zafarani","year":"2014","unstructured":"Zafarani R, Abbasi MA, Liu H. Social media mining: an introduction. Cambridge: Cambridge University Press; 2014."},{"key":"76_CR4","volume-title":"Mathematical underpinnings of analytics: theory and applications","author":"P Grindrod","year":"2015","unstructured":"Grindrod P. Mathematical underpinnings of analytics: theory and applications. Oxford: OUP Oxford; 2015."},{"key":"76_CR5","doi-asserted-by":"publisher","DOI":"10.1039\/C5MB00732A","author":"ME Karabekmez","year":"2015","unstructured":"Karabekmez ME, Kirdar B. A novel topological centrality measure capturing biologically important proteins. Mol Biosyst R Soc Chem. 2015. doi:\n                    10.1039\/C5MB00732A\n                    \n                  .","journal-title":"Mol Biosyst R Soc Chem"},{"issue":"8","key":"76_CR6","doi-asserted-by":"publisher","first-page":"e106132","DOI":"10.1371\/journal.pone.0106132","volume":"9","author":"P Wang","year":"2014","unstructured":"Wang P, Lu J, Yu X. Identification of important nodes in directed biological networks: a network motif approach. PLos ONE. 2014;9(8):e106132. doi:\n                    10.1371\/journal.pone.0106132\n                    \n                  .","journal-title":"PLos ONE"},{"key":"76_CR7","first-page":"193","volume":"2","author":"D Kosch\u00fctzki","year":"2008","unstructured":"Kosch\u00fctzki D, Schreiber F. Centrality analysis methods for biological networks and their application to gene regulatory networks. Gene Regul Syst Biol. 2008;2:193\u2013201.","journal-title":"Gene Regul Syst Biol"},{"issue":"10","key":"76_CR8","doi-asserted-by":"publisher","first-page":"2107","DOI":"10.1002\/asi.21128","volume":"60","author":"E Yan","year":"2010","unstructured":"Yan E, Ding Y. Applying centrality measures to impact analysis: a coauthorship network analysis. J Am Soc Inf Sci Technol. 2010;60(10):2107\u201318. doi:\n                    10.1002\/asi.v60:10\n                    \n                  .","journal-title":"J Am Soc Inf Sci Technol"},{"key":"76_CR9","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnt007","author":"M Benzi","year":"2013","unstructured":"Benzi M, Klymko C. Total communicability as a centrality measure. J Complex Netw. 2013. doi:\n                    10.1093\/comnet\/cnt007\n                    \n                  .","journal-title":"J Complex Netw"},{"key":"76_CR10","unstructured":"Borassi M, Crescenzi P, Marino A. Fast and simple computation of top-k closeness centralities. CoRR, abs\/1507.01490. 2015."},{"key":"76_CR11","unstructured":"Bergamini E, Borassi M, Crescenzi P, Marino A, Meyerhenke H. Extracting top-K closeness centrality faster in unweighted graphs. In: Proceedings of the eighteenth workshop on algorithm engineering and experiments (ALENEX); 2016."},{"issue":"2","key":"76_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1093\/comnet\/cnv016","volume":"4","author":"M Aprahamian","year":"2016","unstructured":"Aprahamian M, Higham DJ, Higham NJ. Matching exponential-based and resolvent-based centrality measures. J Complex Netw. 2016;4(2):157\u201376. doi:\n                    10.1093\/comnet\/cnv016\n                    \n                  .","journal-title":"J Complex Netw."},{"issue":"4","key":"76_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2015","unstructured":"Kempe D, Kleinberg J, Tardos E. Maximizing the spread of influence through a social network. Theory Comput. 2015;11(4):105\u201347. doi:\n                    10.4086\/toc.2015.v011a004\n                    \n                  .","journal-title":"Theory Comput"},{"key":"76_CR14","doi-asserted-by":"crossref","unstructured":"Doo M, Liu L. Extracting top-K most influential nodes by activity analysis. In: IEEE 15th international conference on information reuse and integration (IRI); 2014.","DOI":"10.1109\/IRI.2014.7051894"},{"key":"76_CR15","unstructured":"Li M, Zhang Q, Liu Q, Deng Y. Identification of influential nodes in network of networks. arXiv preprint \n                    http:\/\/arxiv.org\/abs\/1501.05714\n                    \n                  ."},{"key":"76_CR16","first-page":"1371","volume":"7","author":"M Kimura","year":"2007","unstructured":"Kimura M, Saito K, Nakano R. Extracting influential nodes for information diffusion on a social network. AAAI. 2007;7:1371\u20136.","journal-title":"AAAI"},{"key":"76_CR17","doi-asserted-by":"crossref","unstructured":"Zhang Y, Zhou J, Cheng J. Preference-based top-K influential nodes mining in social networks. In: IEEE 10th international conference on trust, security and privacy in computing and communications (TrustCom); 2011.","DOI":"10.1109\/TrustCom.2011.209"},{"key":"76_CR18","doi-asserted-by":"crossref","unstructured":"Leung CK-S, MacKinnon RK, Jiang F. Reducing the search space for big data mining for interesting patterns from uncertain data. In: IEEE international congress on big data (BigData Congress); 2014.","DOI":"10.1109\/BigData.Congress.2014.53"},{"issue":"12","key":"76_CR19","doi-asserted-by":"publisher","first-page":"e0145283","DOI":"10.1371\/journal.pone.0145283","volume":"10","author":"J He","year":"2015","unstructured":"He J, Fu Y, Chen D. A novel top-k strategy for influence maximization in complex networks with community structure. PLoS ONE. 2015;10(12):e0145283.","journal-title":"PLoS ONE"},{"issue":"11","key":"76_CR20","first-page":"2015","volume":"45","author":"W Liu","year":"2015","unstructured":"Liu W, Deng Z, Cao L, Xu X, Liu H, Gong X. Mining top-K spread sources for a specific topic and a given node. IEEE Trans Cybern. 2015;45(11):2015.","journal-title":"IEEE Trans Cybern"},{"key":"76_CR21","doi-asserted-by":"crossref","unstructured":"Cupertino TH, Zhao L. Using katz centrality to classify multiple pattern transformations. In: Brazilian Symposium on Neural Networks (SBRN); 2012.","DOI":"10.1109\/SBRN.2012.23"},{"key":"76_CR22","doi-asserted-by":"crossref","unstructured":"Ilyas MU, Radha H. Identifying influential nodes in online social networks using principal component centrality. In: IEEE international conference on communications (ICC); 2011.","DOI":"10.1109\/icc.2011.5963147"},{"issue":"6","key":"76_CR23","first-page":"066","volume":"83","author":"R Ghosh","year":"2011","unstructured":"Ghosh R, Lerman K. Parameterized centrality metric for network analysis. Phys Rev E. 2011;83(6):066\u2013118.","journal-title":"Phys Rev E"},{"key":"76_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/b107408","volume-title":"The data mining and knowledge discovery handbook","author":"O Maimon","year":"2005","unstructured":"Maimon O, Rokach L. The data mining and knowledge discovery handbook. Berlin: Springer; 2005."},{"key":"76_CR25","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"L Freeman","year":"1977","unstructured":"Freeman L. A set of measures of centrality based upon betweenness. Sociometry. 1977;40:35\u201341. doi:\n                    10.2307\/3033543\n                    \n                  .","journal-title":"Sociometry"},{"issue":"1","key":"76_CR26","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz L. A new status index derived from sociometric analysis. Psychometrika. 1953;18(1):39\u201343.","journal-title":"Psychometrika"},{"key":"76_CR27","unstructured":"Benzi M, Klymko C. On the limiting behavior of parameter-dependent network centrality measures. arXiv preprint, \n                    arXiv: 1312.6722\n                    \n                  ; 2015."},{"key":"76_CR28","unstructured":"Benzi M, Klymko C. A matrix analysis of different centrality measures. \n                    arXiv:1312.6722v3\n                    \n                  ; 2014."},{"key":"76_CR29","unstructured":"Newman MEJ. Network data. \n                    http:\/\/www-personal.umich.edu\/~mejn\/netdata\/\n                    \n                  ."},{"key":"76_CR30","doi-asserted-by":"crossref","unstructured":"Bostock M, Ogievetsky V, Heer J. D3: Data-Driven Documents. IEEE Trans Visual Comp Graphics (Proc. InfoVis); 2011. \n                    http:\/\/vis.stanford.edu\/papers\/d3\n                    \n                  .","DOI":"10.1109\/TVCG.2011.185"},{"issue":"4","key":"76_CR31","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary WW. An information flow model for conflict and fission in small groups. J Anthropol Res. 1977;33(4):452\u201373.","journal-title":"J Anthropol Res"},{"key":"76_CR32","unstructured":"Braun ML. jblas: Fast Linear Algebra for JAVA. Berlin: TU Berlin; 2010. \n                    http:\/\/jblas.org\n                    \n                  . Accessed 12 Sept 2016."},{"key":"76_CR33","unstructured":"Graph-Stream. \n                    http:\/\/graphstream-project.org\/\n                    \n                  . Accessed 10 Sept 2016."},{"key":"76_CR34","unstructured":"Leskovec J, Krevl A. SNAP datasets: stanford large network dataset collection. 2014. \n                    http:\/\/snap.stanford.edu\/data\n                    \n                  . Accessed 18 Sept 2016."},{"key":"76_CR35","unstructured":"ILAB: Interdisciplinary Research Institute. \n                    http:\/\/www.ilabsite.org\/?page_id=1088\n                    \n                  . Accessed 21 Sept 2016."},{"key":"76_CR36","unstructured":"Facebook: online social networking service; 2004. \n                    https:\/\/www.facebook.com\/"},{"key":"76_CR37","unstructured":"Epinions. General consumer review site; 1999. \n                    http:\/\/www.epinions.com\/\n                    \n                  . Accessed 16 Sept 2016."}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-017-0076-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s40537-017-0076-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-017-0076-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T23:32:18Z","timestamp":1589671938000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-017-0076-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,30]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["76"],"URL":"https:\/\/doi.org\/10.1186\/s40537-017-0076-5","relation":{},"ISSN":["2196-1115"],"issn-type":[{"value":"2196-1115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,30]]},"assertion":[{"value":"27 December 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"16"}}