{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:24:03Z","timestamp":1743009843816,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030337773"},{"type":"electronic","value":"9783030337780"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-33778-0_32","type":"book-chapter","created":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T14:28:50Z","timestamp":1571408930000},"page":"428-442","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Resampling-Based Framework for Unbiased Estimator of Node Centrality over Large Complex Network"],"prefix":"10.1007","author":[{"given":"Kazumi","family":"Saito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kouzou","family":"Ohara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiro","family":"Kimura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Motoda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,16]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"AlGhamdi, Z., Jamour, F., Skiadopoulos, S., Kalnis, P.: A benchmark for betweenness centrality approximation algorithms on large graphs. In: Proceedings of the 29th International Conference on Scientific and Statistical Database Management (2017)","DOI":"10.1145\/3085504.3085510"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1086\/228631","volume":"92","author":"P Bonacichi","year":"1987","unstructured":"Bonacichi, P.: Power and centrality: a family of measures. Am. J. Sociol. 92, 1170\u20131182 (1987)","journal-title":"Am. J. Sociol."},{"key":"32_CR3","doi-asserted-by":"publisher","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, 163\u2013177 (2001)","journal-title":"J. Math. Sociol."},{"issue":"7","key":"32_CR4","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1142\/S0218127407018403","volume":"17","author":"U Brandes","year":"2007","unstructured":"Brandes, U., Pich, C.: Centrality estimation in large networks. Int. J. Bifurcat. Chaos 17(7), 303\u2013318 (2007)","journal-title":"Int. J. Bifurcat. Chaos"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30, 107\u2013117 (1998)","journal-title":"Comput. Netw. ISDN Syst."},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/2.781636","volume":"32","author":"S Chakrabarti","year":"1999","unstructured":"Chakrabarti, S., et al.: Mining the web\u2019s link structure. IEEE Comput. 32, 60\u201367 (1999)","journal-title":"IEEE Comput."},{"issue":"4","key":"32_CR7","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H Chernoff","year":"1952","unstructured":"Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23(4), 493\u2013507 (1952)","journal-title":"Ann. Math. Stat."},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"L Freeman","year":"1979","unstructured":"Freeman, L.: Centrality in social networks: conceptual clarification. Soc. Netw. 1, 215\u2013239 (1979)","journal-title":"Soc. Netw."},{"issue":"1\u20136","key":"32_CR9","first-page":"295","volume":"33","author":"MR Henzinger","year":"2000","unstructured":"Henzinger, M.R., Heydon, A., Mitzenmacher, M., Najork, M.: On near-uniform URL sampling. Int. J. Comput. Telecommun. Network. 33(1\u20136), 295\u2013308 (2000)","journal-title":"Int. J. Comput. Telecommun. Network."},{"issue":"301","key":"32_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."},{"key":"32_CR11","first-page":"39","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz, L.: A new status index derived from sociometric analysis. Sociometry 18, 39\u201343 (1953)","journal-title":"Sociometry"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41060-015-0001-y","volume":"1","author":"M Kimura","year":"2016","unstructured":"Kimura, M., Saito, K., Ohara, K., Motoda, H.: Speeding-up node influence computation for huge social networks. Int. J. Data Sci. Anal. 1, 1\u201314 (2016)","journal-title":"Int. J. Data Sci. Anal."},{"key":"32_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-540-30115-8_22","volume-title":"Machine Learning: ECML 2004","author":"B Klimt","year":"2004","unstructured":"Klimt, B., Yang, Y.: The Enron corpus: a new dataset for email classification research. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) ECML 2004. LNCS (LNAI), vol. 3201, pp. 217\u2013226. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30115-8_22"},{"issue":"9","key":"32_CR14","doi-asserted-by":"publisher","first-page":"1799","DOI":"10.1109\/JSAC.2011.111005","volume":"29","author":"M Kurant","year":"2011","unstructured":"Kurant, M., Markopoulou, A., Thiran, P.: Towards unbiased BFS sampling. IEEE J. Sel. Areas Commun. 29(9), 1799\u20131809 (2011)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2006), pp. 631\u2013636 (2006)","DOI":"10.1145\/1150402.1150479"},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"016132","DOI":"10.1103\/PhysRevE.64.016132","volume":"64","author":"MEJ Newman","year":"2001","unstructured":"Newman, M.E.J.: Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. Phys. Rev. E 64, 016132 (2001)","journal-title":"Phys. Rev. E"},{"key":"32_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-319-11812-3_20","volume-title":"Discovery Science","author":"K Ohara","year":"2014","unstructured":"Ohara, K., Saito, K., Kimura, M., Motoda, H.: Resampling-based framework for estimating node centrality of large social network. In: D\u017eeroski, S., Panov, P., Kocev, D., Todorovski, L. (eds.) DS 2014. LNCS (LNAI), vol. 8777, pp. 228\u2013239. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11812-3_20"},{"key":"32_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-319-18038-0_11","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"K Ohara","year":"2015","unstructured":"Ohara, K., Saito, K., Kimura, M., Motoda, H.: Resampling-based gap analysis for detecting nodes with high centrality on large social network. In: Cao, T., Lim, E.-P., Zhou, Z.-H., Ho, T.-B., Cheung, D., Motoda, H. (eds.) PAKDD 2015. LNCS (LNAI), vol. 9077, pp. 135\u2013147. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18038-0_11"},{"key":"32_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-319-46307-0_24","volume-title":"Discovery Science","author":"K Ohara","year":"2016","unstructured":"Ohara, K., Saito, K., Kimura, M., Motoda, H.: Accelerating computation of distance based centrality measures for spatial networks. In: Calders, T., Ceci, M., Malerba, D. (eds.) DS 2016. LNCS (LNAI), vol. 9956, pp. 376\u2013391. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46307-0_24"},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Ohara, K., Saito, K., Kimura, M., Motoda, H.: Resampling-based predictive simulation framework of stochastic diffusion model for identifying top-k influential nodes. Int. J. Data Sci. Anal (2019, online first)","DOI":"10.1007\/s41060-019-00183-3"},{"key":"32_CR21","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla, G., Der\u00e9nyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 814\u2013818 (2005)","journal-title":"Nature"},{"issue":"2","key":"32_CR22","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. Disc. 30(2), 438\u2013475 (2016)","journal-title":"Data Min. Knowl. Disc."},{"issue":"2","key":"32_CR23","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"VN Vapnik","year":"1971","unstructured":"Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16(2), 264\u2013280 (1971)","journal-title":"Theory Probab. Appl."},{"key":"32_CR24","doi-asserted-by":"publisher","first-page":"104057","DOI":"10.1109\/ACCESS.2019.2927681","volume":"7","author":"S Wandelt","year":"2019","unstructured":"Wandelt, S., Shi, X., Sun, X.: Scalability of betweenness approximation algorithms: an experimental review. IEEE Access 7, 104057\u2013104071 (2019)","journal-title":"IEEE Access"},{"key":"32_CR25","doi-asserted-by":"publisher","first-page":"1824","DOI":"10.1002\/asi.21353","volume":"61","author":"H Zhuge","year":"2010","unstructured":"Zhuge, H., Zhang, J.: Topological centrality and its e-Science applications. J. Am. Soc. Inf. Sci. Technol. 61, 1824\u20131841 (2010)","journal-title":"J. Am. Soc. Inf. Sci. Technol."}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33778-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:34:46Z","timestamp":1709825686000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-33778-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030337773","9783030337780"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33778-0_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discovery Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Split","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","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":"28 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dis2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ds2019.irb.hr\/","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":"63","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":"21","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":"19","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":"33% - 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":"3","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":"4","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}