{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T14:45:03Z","timestamp":1725979503726},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319911885"},{"type":"electronic","value":"9783319911892"}],"license":[{"start":{"date-parts":[[2018,5,27]],"date-time":"2018-05-27T00:00:00Z","timestamp":1527379200000},"content-version":"unspecified","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-319-91189-2_20","type":"book-chapter","created":{"date-parts":[[2018,5,26]],"date-time":"2018-05-26T16:37:06Z","timestamp":1527352626000},"page":"197-207","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Enhancing Stratified Graph Sampling Algorithms Based on Approximate Degree Distribution"],"prefix":"10.1007","author":[{"given":"Junpeng","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenyu","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,27]]},"reference":[{"key":"20_CR1","volume-title":"Data Mining: Concepts and Techniques","author":"J Han","year":"2005","unstructured":"Han, J.: Data Mining: Concepts and Techniques, 3rd edn. Morgan Kaufmann Publishers Inc., San Francisco (2005)","edition":"3"},{"issue":"4","key":"20_CR2","first-page":"661","volume":"51","author":"A Clauset","year":"2009","unstructured":"Clauset, A., Shalizi, C.R., Newman, M.E.J.: Power-law distributions in empirical data. Soc. Ind. Appl. Math. 51(4), 661\u2013703 (2009)","journal-title":"Soc. Ind. Appl. Math."},{"key":"20_CR3","unstructured":"Yu, L.: Sampling and characterizing online social networks. Dissertation. The University of Bristol, England (2016)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Maiya, A.S., Berger-Wolf, T.Y.: Benefits of bias: towards better characterization of network sampling. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 105\u2013113 (2011)","DOI":"10.1145\/2020408.2020431"},{"issue":"2","key":"20_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2601438","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) 8(2), 1\u201356 (2014)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Stutzbach, D., et al.: Sampling techniques for large, dynamic graphs. In: Proceedings of 25th IEEE International Conference on Computer Communications, INFOCOM 2006. IEEE, pp. 1\u20136 (2006)","DOI":"10.1109\/INFOCOM.2006.39"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Gjoka, M., Kurant, M., Butts, C.T., Markopoulou, A.: Walking in Facebook: a case study of unbiased sampling of OSNs. In: INFOCOM, Proceedings, pp. 1\u20139. IEEE (2010)","DOI":"10.1109\/INFCOM.2010.5462078"},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1145\/2318857.2254795","volume":"40","author":"CH Lee","year":"2012","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. ACM SIGMETRICS Perform. Eval. Rev. 40(1), 319\u2013330 (2012)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"20_CR9","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, pp. 631\u2013636. ACM (2006)","DOI":"10.1145\/1150402.1150479"},{"issue":"1","key":"20_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1145\/1993744.1993773","volume":"39","author":"M Kurant","year":"2011","unstructured":"Kurant, M., Gjoka, M., Butts, C.T., Markopoulou, A.: Walking on a graph with a magnifying glass: stratified sampling via weighted random walks. ACM SIGMETRICS Perform. Eval. Rev. 39(1), 241\u2013252 (2011)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"20_CR11","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., et al.: Introduction to Algorithms, 3rd (edn.), 30(00), 118\u2013118 (2015)"},{"key":"20_CR12","unstructured":"SNAP homepage. http:\/\/snap.stanford.edu\/data\/index.html"},{"key":"20_CR13","unstructured":"Bora, D.J., Gupta, A.K.: Effect of different distance measures on the performance of k-means algorithm: an experimental study in Matlab. Computer Science (2014)"},{"issue":"5","key":"20_CR14","doi-asserted-by":"publisher","first-page":"62","DOI":"10.3390\/sym9050062","volume":"9","author":"B Kim","year":"2017","unstructured":"Kim, B., Kim, J.M., Yi, G.: Analysis of clustering evaluation considering features of item response data using data mining technique for setting cut-off scores. Symmetry 9(5), 62 (2017)","journal-title":"Symmetry"},{"key":"20_CR15","first-page":"130","volume-title":"Lecture Notes in Computer Science","author":"Derek Doran","year":"2015","unstructured":"Doran, D.: Triad-based role discovery for large social systems. In: Social Informatics, pp. 130\u2013143 (2014)"},{"key":"20_CR16","unstructured":"de Heer, W.: Harmonic syntax and high-level statistics of the songs of three early Classical composers, EECS Department, University of California, Berkeley, 167 (2017)"}],"container-title":["Advances in Intelligent Systems and Computing","Artificial Intelligence and Algorithms in Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91189-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T16:04:58Z","timestamp":1604333098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-91189-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,27]]},"ISBN":["9783319911885","9783319911892"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91189-2_20","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2018,5,27]]}}}