{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:10:31Z","timestamp":1743109831984,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":25,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819605668"},{"type":"electronic","value":"9789819605675"}],"license":[{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-0567-5_32","type":"book-chapter","created":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T08:37:23Z","timestamp":1733128643000},"page":"456-466","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Estimation of\u00a0Graph Features Based on\u00a0Random Walks Using Neighbors\u2019 Properties"],"prefix":"10.1007","author":[{"given":"Tsuyoshi","family":"Hasegawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7994-2858","authenticated-orcid":false,"given":"Shiori","family":"Hironaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3939-9800","authenticated-orcid":false,"given":"Kazuyuki","family":"Shudo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,3]]},"reference":[{"unstructured":"Facebook API documents. https:\/\/developers.facebook.com\/docs\/graph-api. Accessed 19 Nov 2023","key":"32_CR1"},{"unstructured":"Mastodon API documents. https:\/\/docs.joinmastodon.org\/api. Accessed 19 Nov 2023","key":"32_CR2"},{"unstructured":"Twitter API documents. https:\/\/developer.twitter.com\/en\/docs\/twitter-api. Accessed 19 Nov 2023","key":"32_CR3"},{"doi-asserted-by":"crossref","unstructured":"Ahn, Y.Y., Han, S., Kwak, H., Moon, S., Jeong, H.: Analysis of topological characteristics of huge online social networking services. In: Proceedings of the 16th International Conference on World Wide Web, pp. 835\u2013844 (2007)","key":"32_CR4","DOI":"10.1145\/1242572.1242685"},{"issue":"3","key":"32_CR5","doi-asserted-by":"publisher","first-page":"253","DOI":"10.14778\/3021924.3021940","volume":"10","author":"X Chen","year":"2016","unstructured":"Chen, X., Li, Y., Wang, P., Lui, J.C.S.: A general framework for estimating graphlet statistics via random walk. Proc. VLDB Endow. 10(3), 253\u2013264 (2016)","journal-title":"Proc. VLDB Endow."},{"doi-asserted-by":"crossref","unstructured":"Chiericetti, F., Dasgupta, A., Kumar, R., Lattanzi, S., Sarl\u00f3s, T.: On sampling nodes in a network. In: Proceedings of the 25th International Conference on World Wide Web, pp. 471\u2013481 (2016)","key":"32_CR6","DOI":"10.1145\/2872427.2883045"},{"issue":"9","key":"32_CR7","doi-asserted-by":"publisher","first-page":"1872","DOI":"10.1109\/JSAC.2011.111011","volume":"29","author":"M Gjoka","year":"2011","unstructured":"Gjoka, M., Kurant, M., Butts, C.T., Markopoulou, A.: Practical recommendations on crawling online social networks. IEEE J. Sel. Areas Commun. 29(9), 1872\u20131892 (2011)","journal-title":"IEEE J. Sel. Areas Commun."},{"doi-asserted-by":"crossref","unstructured":"Han, G., Sethu, H.: Waddling random walk: fast and accurate mining of motif statistics in large graphs. In: Proceedings of the 2016 IEEE 16th International Conference on Data Mining, pp. 181\u2013190 (2016)","key":"32_CR8","DOI":"10.1109\/ICDM.2016.0029"},{"doi-asserted-by":"crossref","unstructured":"Hardiman, S.J., Katzir, L.: Estimating clustering coefficients and size of social networks via random walk. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 539\u2013550 (2013)","key":"32_CR9","DOI":"10.1145\/2488388.2488436"},{"unstructured":"Hasegawa, T., Hironaka, S., Shudo, K.: Estimation of graph features based on random walks using neighbors\u2019 properties (2024). https:\/\/arxiv.org\/abs\/2409.08599","key":"32_CR10"},{"issue":"4","key":"32_CR11","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/j.socnet.2012.09.001","volume":"34","author":"J Illenberger","year":"2012","unstructured":"Illenberger, J., Fl\u00f6tter\u00f6d, G.: Estimating network properties from snowball sampled data. Soc. Netw. 34(4), 701\u2013711 (2012)","journal-title":"Soc. Netw."},{"doi-asserted-by":"crossref","unstructured":"Iwasaki, K., Shudo, K.: Comparing graph sampling methods based on the number of queries. In: Proceedings of the 2018 IEEE International Conference on Parallel & Distributed Processing with Applications, Ubiquitous Computing & Communications, Big Data & Cloud Computing, Social Computing & Networking, Sustainable Computing & Communications, pp. 1136\u20131143 (2018)","key":"32_CR12","DOI":"10.1109\/BDCloud.2018.00168"},{"doi-asserted-by":"crossref","unstructured":"Iwasaki, K., Shudo, K.: Estimating the clustering coefficient of a social network by a non-backtracking random walk. In: Proceedings of the 2018 IEEE International Conference on Big Data and Smart Computing, pp. 114\u2013118 (2018)","key":"32_CR13","DOI":"10.1109\/BigComp.2018.00025"},{"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."},{"doi-asserted-by":"crossref","unstructured":"Kwak, H., Lee, C., Park, H., Moon, S.: What is Twitter, a social network or a news media? In: Proceedings of the 19th International Conference on World Wide Web, pp. 591\u2013600 (2010)","key":"32_CR15","DOI":"10.1145\/1772690.1772751"},{"doi-asserted-by":"crossref","unstructured":"Lee, C.H., Xu, X., Eun, D.Y.: Beyond random walk and metropolis-hastings samplers: why you should not backtrack for unbiased graph sampling. In: Proceedings of the 12th ACM SIGMETRICS\/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, pp. 319\u2013330 (2012)","key":"32_CR16","DOI":"10.1145\/2254756.2254795"},{"unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection (2014). http:\/\/snap.stanford.edu\/data","key":"32_CR17"},{"doi-asserted-by":"crossref","unstructured":"Li, R.H., Yu, J.X., Qin, L., Mao, R., Jin, T.: On random walk based graph sampling. In: Proceedings of the 2015 IEEE 31st International Conference on Data Engineering, pp. 927\u2013938 (2015)","key":"32_CR18","DOI":"10.1109\/ICDE.2015.7113345"},{"doi-asserted-by":"crossref","unstructured":"Matsumura, T., Iwasaki, K., Shudo, K.: Average path length estimation of social networks by random walk. In: Proceedings of the 2018 IEEE International Conference on Big Data and Smart Computing, pp. 611\u2013614 (2018)","key":"32_CR19","DOI":"10.1109\/BigComp.2018.00107"},{"doi-asserted-by":"crossref","unstructured":"Matsumura, T., Shudo, K.: Metropolis-hastings random walk with a reduced number of self-loops. In: Proceedings of the 2019 IEEE International Conference on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking, pp. 1556\u20131563 (2019)","key":"32_CR20","DOI":"10.1109\/ISPA-BDCloud-SustainCom-SocialCom48970.2019.00229"},{"doi-asserted-by":"crossref","unstructured":"Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, pp. 29\u201342 (2007)","key":"32_CR21","DOI":"10.1145\/1298306.1298311"},{"doi-asserted-by":"crossref","unstructured":"Nakajima, K., Iwasaki, K., Matsumura, T., Shudo, K.: Estimating top-k betweenness centrality nodes in online social networks. In: Proceedings of the 2018 IEEE International Conference on Parallel & Distributed Processing with Applications, Ubiquitous Computing & Communications, Big Data & Cloud Computing, Social Computing & Networking, Sustainable Computing & Communications, pp. 1128\u20131135 (2018)","key":"32_CR22","DOI":"10.1109\/BDCloud.2018.00167"},{"unstructured":"P\u00f3sfai, M., Barabasi, A.L.: Network Science. Cambridge University Press, Cambridge (2016)","key":"32_CR23"},{"doi-asserted-by":"crossref","unstructured":"Rasti, A.H., Torkjazi, M., Rejaie, R., Duffield, N., Willinger, W., Stutzbach, D.: Respondent-driven sampling for characterizing unstructured overlays. In: Proceedings of the 28th International Conference on Computer Communications, pp. 2701\u20132705 (2009)","key":"32_CR24","DOI":"10.1109\/INFCOM.2009.5062215"},{"doi-asserted-by":"crossref","unstructured":"Ribeiro, B., Towsley, D.: On the estimation accuracy of degree distributions from graph sampling. In: Proceedings of the 51st IEEE Conference on Decision and Control, pp. 5240\u20135247 (2012)","key":"32_CR25","DOI":"10.1109\/CDC.2012.6425857"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0567-5_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T09:10:19Z","timestamp":1733130619000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0567-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,3]]},"ISBN":["9789819605668","9789819605675"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0567-5_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,3]]},"assertion":[{"value":"3 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Doha","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qatar","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wise2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wise2024-qatar.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}