{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T05:20:12Z","timestamp":1755926412945,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030389604"},{"type":"electronic","value":"9783030389611"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-38961-1_50","type":"book-chapter","created":{"date-parts":[[2020,1,22]],"date-time":"2020-01-22T01:34:32Z","timestamp":1579656872000},"page":"584-598","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Sampling Based Katz Centrality Estimation for Large-Scale Social Networks"],"prefix":"10.1007","author":[{"given":"Mingkai","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9199-3655","authenticated-orcid":false,"given":"Wenzhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cam-tu","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoliang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanglu","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"key":"50_CR1","unstructured":"Livemocha network dataset - KONECT, April 2017. http:\/\/konect.uni-koblenz.de\/networks\/livemocha"},{"issue":"2","key":"50_CR2","first-page":"7","volume":"8","author":"NK Ahmed","year":"2014","unstructured":"Ahmed, N.K., Neville, J., Kompella, R.: Network sampling: from static to streaming graphs. ACM Trans. Knowl. Discov. Data (TKDD 2014) 8(2), 7 (2014)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD 2014)"},{"key":"50_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1007\/978-3-540-76298-0_52","volume-title":"The Semantic Web","author":"S Auer","year":"2007","unstructured":"Auer, S., Bizer, C., Kobilarov, G., Lehmann, J., Cyganiak, R., Ives, Z.: DBpedia: a nucleus for a web of open data. In: Aberer, K., et al. (eds.) ASWC\/ISWC -2007. LNCS, vol. 4825, pp. 722\u2013735. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76298-0_52"},{"key":"50_CR4","unstructured":"Balkanski, E., Singer, Y.: Approximation guarantees for adaptive sampling. In: International Conference on Machine Learning (ICML 2018), pp. 393\u2013402 (2018)"},{"issue":"3\u20134","key":"50_CR5","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1080\/15427951.2013.865686","volume":"10","author":"P Boldi","year":"2014","unstructured":"Boldi, P., Vigna, S.: Axioms for centrality. Internet Math. 10(3\u20134), 222\u2013262 (2014)","journal-title":"Internet Math."},{"issue":"1\u20132","key":"50_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1080\/15427951.2012.625256","volume":"8","author":"F Bonchi","year":"2012","unstructured":"Bonchi, F., Esfandiar, P., Gleich, D.F., Greif, C., Lakshmanan, L.V.: Fast matrix computations for pairwise and columnwise commute times and Katz scores. Internet Math. 8(1\u20132), 73\u2013112 (2012)","journal-title":"Internet Math."},{"key":"50_CR7","volume-title":"Networks, Crowds, and Markets: Reasoning About a Highly Connected World","author":"E David","year":"2010","unstructured":"David, E., Jon, K.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, New York (2010)"},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"Eden, T., Jain, S., Pinar, A., Ron, D., Seshadhri, C.: Provable and practical approximations for the degree distribution using sublinear graph samples. In: Proceedings of the 27th International Conference on World Wide Web (WWW 2018), pp. 449\u2013458 (2018)","DOI":"10.1145\/3178876.3186111"},{"issue":"4","key":"50_CR9","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1023\/A:1013470632383","volume":"7","author":"KC Foster","year":"2001","unstructured":"Foster, K.C., Muth, S.Q., Potterat, J.J., Rothenberg, R.B.: A faster Katz status score algorithm. Comput. Math. Organ. Theory 7(4), 275\u2013285 (2001)","journal-title":"Comput. Math. Organ. Theory"},{"issue":"301","key":"50_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"issue":"260","key":"50_CR11","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1080\/01621459.1952.10483446","volume":"47","author":"DG Horvitz","year":"1952","unstructured":"Horvitz, D.G., Thompson, D.J.: A generalization of sampling without replacement from a finite universe. J. Am. Stat. Assoc. 47(260), 663\u2013685 (1952)","journal-title":"J. Am. Stat. Assoc."},{"issue":"1","key":"50_CR12","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 18(1), 39\u201343 (1953)","journal-title":"Psychometrika"},{"key":"50_CR13","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2003), pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"50_CR14","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: Proceedings of the 12th International Conference on Knowledge Discovery and Data Mining (KDD 2006), pp. 631\u2013636. ACM (2006)","DOI":"10.1145\/1150402.1150479"},{"key":"50_CR15","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Statistical properties of community structure in large social and information networks. In: Proceedings of the 17th International Conference on World Wide Web, pp. 695\u2013704. ACM (2008)","DOI":"10.1145\/1367497.1367591"},{"key":"50_CR16","doi-asserted-by":"crossref","unstructured":"Maiya, A.S., Berger-Wolf, T.Y.: Benefits of bias: towards better characterization of network sampling. In: Proceedings of the 17th International Conference on Knowledge Discovery and Data Mining (KDD 2011), pp. 105\u2013113. ACM (2011)","DOI":"10.1145\/2020408.2020431"},{"issue":"1","key":"50_CR17","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1017\/S1351324909005129","volume":"16","author":"C Manning","year":"2010","unstructured":"Manning, C., Raghavan, P., Sch\u00fctze, H.: Introduction to information retrieval. Nat. Lang. Eng. 16(1), 100\u2013103 (2010)","journal-title":"Nat. Lang. Eng."},{"key":"50_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-319-78024-5_26","volume-title":"Parallel Processing and Applied Mathematics","author":"E Nathan","year":"2018","unstructured":"Nathan, E., Bader, D.A.: Approximating personalized Katz centrality in dynamic graphs. In: Wyrzykowski, R., Dongarra, J., Deelman, E., Karczewski, K. (eds.) PPAM 2017. LNCS, vol. 10777, pp. 290\u2013302. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78024-5_26"},{"key":"50_CR19","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.procs.2017.05.021","volume":"108","author":"E Nathan","year":"2017","unstructured":"Nathan, E., Sanders, G., Fairbanks, J., Bader, D.A., et al.: Graph ranking guarantees for numerical approximations to Katz centrality. Procedia Comput. Sci. 108, 68\u201378 (2017)","journal-title":"Procedia Comput. Sci."},{"issue":"2","key":"50_CR20","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/s10618-015-0423-0","volume":"30","author":"M Riondato","year":"2016","unstructured":"Riondato, M., Kornaropoulos, E.M.: Fast approximation of betweenness centrality through sampling. Data Min. Knowl. Discov. 30(2), 438\u2013475 (2016)","journal-title":"Data Min. Knowl. Discov."},{"issue":"5","key":"50_CR21","first-page":"61","volume":"12","author":"M Riondato","year":"2018","unstructured":"Riondato, M., Upfal, E.: ABRA: approximating betweenness centrality in static and dynamic graphs with Rademacher averages. ACM Trans. Knowl. Discov. Data (TKDD 2018) 12(5), 61 (2018)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD 2018)"},{"key":"50_CR22","unstructured":"Takac, L., Zabovsky, M.: Data analysis in public social networks. In: International Scientific Conference and International Workshop Present Day Trends of Innovations, vol. 1 (2012)"},{"key":"50_CR23","doi-asserted-by":"crossref","unstructured":"Wagner, C., Singer, P., Karimi, F., Pfeffer, J., Strohmaier, M.: Sampling from social networks with attributes. In: Proceedings of the 26th International Conference on World Wide Web (WWW 2017), pp. 1181\u20131190 (2017)","DOI":"10.1145\/3038912.3052665"},{"key":"50_CR24","doi-asserted-by":"crossref","unstructured":"Was, T., Skibski, O.: An axiomatization of the eigenvector and Katz centralities. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI 2018) (2018)","DOI":"10.1609\/aaai.v32i1.11435"},{"issue":"9","key":"50_CR25","doi-asserted-by":"publisher","first-page":"e24306","DOI":"10.1371\/journal.pone.0024306","volume":"6","author":"J Zhao","year":"2011","unstructured":"Zhao, J., Yang, T.H., Huang, Y., Holme, P.: Ranking candidate disease genes from gene expression and protein interaction: a Katz-centrality based approach. PLoS ONE 6(9), e24306 (2011)","journal-title":"PLoS ONE"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38961-1_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T08:12:57Z","timestamp":1657872777000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-38961-1_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030389604","9783030389611"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38961-1_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"251","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}