{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:54Z","timestamp":1750221354725,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":22,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSERC","award":["RGPIN-2014-04463"],"award-info":[{"award-number":["RGPIN-2014-04463"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3184558.3186240","type":"proceedings-article","created":{"date-parts":[[2018,4,18]],"date-time":"2018-04-18T18:04:25Z","timestamp":1524074665000},"page":"495-499","source":"Crossref","is-referenced-by-count":0,"title":["Uniform Random Sampling Not Recommended"],"prefix":"10.1145","author":[{"given":"Jianguo","family":"Lu","sequence":"first","affiliation":[{"name":"University of Windsor, Windsor, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Windsor, Windsor, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dingding","family":"Li","sequence":"additional","affiliation":[{"name":"University of Windsor, Windsor, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3184558.3186240-1","doi-asserted-by":"crossref","unstructured":"Z. Bar-Yossef and M. Gurevich. Random sampling from a search engine's index. Journal of the ACM, 55(5):1--74, 2008.","DOI":"10.1145\/1411509.1411514"},{"key":"key-10.1145\/3184558.3186240-2","doi-asserted-by":"crossref","unstructured":"A. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509--512, 1999.","DOI":"10.1126\/science.286.5439.509"},{"key":"key-10.1145\/3184558.3186240-3","doi-asserted-by":"crossref","unstructured":"A. Broder and et al. Estimating corpus size via queries. In CIKM, pages 594--603. ACM, 2006.","DOI":"10.1145\/1183614.1183699"},{"key":"key-10.1145\/3184558.3186240-4","doi-asserted-by":"crossref","unstructured":"A. Chao, S. Lee, and S. Jeng. Estimating population size for capture-recapture data when capture probabilities vary by time and individual animal. Biometrics, 48(1):201--216, 1992.","DOI":"10.2307\/2532750"},{"key":"key-10.1145\/3184558.3186240-5","doi-asserted-by":"crossref","unstructured":"A. Dasgupta, R. Kumar, and T. Sarlos. On estimating the average degree. In Proceedings of the 23rd international conference on World wide web, pages 795--806. International World Wide Web Conferences Steering Committee, 2014.","DOI":"10.1145\/2566486.2568019"},{"key":"key-10.1145\/3184558.3186240-6","unstructured":"M. Gjoka, M. Kurant, C. Butts, and A. Markopoulou. A walk in facebook: Uniform sampling of users in online social networks. Arxiv preprint arXiv:0906.0060, 2009."},{"key":"key-10.1145\/3184558.3186240-7","doi-asserted-by":"crossref","unstructured":"L. A. Goodman. Some practical techniques in serial number analysis. Journal of the American Statistical Association, 49(265):97--112, 1954.","DOI":"10.1080\/01621459.1954.10501218"},{"key":"key-10.1145\/3184558.3186240-8","doi-asserted-by":"crossref","unstructured":"S. J. Hardiman and L. Katzir. Estimating clustering coefficients and size of social networks via random walk. In Proceedings of the 22nd international conference on World Wide Web, pages 539--550. ACM, 2013.","DOI":"10.1145\/2488388.2488436"},{"key":"key-10.1145\/3184558.3186240-9","doi-asserted-by":"crossref","unstructured":"M. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork. On near-uniform url sampling. Computer Networks, 33(1--6):295--308, 2000.","DOI":"10.1016\/S1389-1286(00)00055-4"},{"key":"key-10.1145\/3184558.3186240-10","doi-asserted-by":"crossref","unstructured":"H. Huang, N. Zhang, W. Wang, G. Das, and A. Szalay. Just-in-time analytics on large file systems. Computer, 61(11):1651--1664, 2012.","DOI":"10.1109\/TC.2011.186"},{"key":"key-10.1145\/3184558.3186240-11","doi-asserted-by":"crossref","unstructured":"L. Katzir, E. Liberty, and O. Somekh. Estimating sizes of social networks via biased sampling. In WWW, pages 597--606. ACM, 2011.","DOI":"10.1145\/1963405.1963489"},{"key":"key-10.1145\/3184558.3186240-12","doi-asserted-by":"crossref","unstructured":"S. Lawrence and C. Giles. Searching the world wide web. Science, 280(5360):98--100, 1998.","DOI":"10.1126\/science.280.5360.98"},{"key":"key-10.1145\/3184558.3186240-13","doi-asserted-by":"crossref","unstructured":"J. Leskovec and C. Faloutsos. Sampling from large graphs. In SIGKDD, pages 631--636. ACM, 2006.","DOI":"10.1145\/1150402.1150479"},{"key":"key-10.1145\/3184558.3186240-14","doi-asserted-by":"crossref","unstructured":"J. Lu and D. Li. Sampling online social networks by random walk. In ACM SIGKDD Workshop on Hot Topics in Online Social Networks, pages 33--40. ACM, 2012.","DOI":"10.1145\/2392622.2392628"},{"key":"key-10.1145\/3184558.3186240-15","doi-asserted-by":"crossref","unstructured":"J. Lu and D. Li. Bias correction in small sample from big data. TKDE, IEEE Transactions on Knowledge and Data Engineering, 25(11):2658--2663, 2013.","DOI":"10.1109\/TKDE.2012.220"},{"key":"key-10.1145\/3184558.3186240-16","doi-asserted-by":"crossref","unstructured":"J. Lu and H. Wang. Variance reduction in large graph sampling. Information Processing and Management, 50(3):476--491, 2014.","DOI":"10.1016\/j.ipm.2014.02.003"},{"key":"key-10.1145\/3184558.3186240-17","doi-asserted-by":"crossref","unstructured":"J. Lu and H. Wang. Uniform random sampling not recommended for large graph size estimation. Information Sciences, 421:136--153, 2017.","DOI":"10.1016\/j.ins.2017.08.030"},{"key":"key-10.1145\/3184558.3186240-18","unstructured":"S. Mane, S. Mopuru, K. Mehra, and J. Srivastava. Network size estimation in a peer-to-peer network. University of Minnesota, MN, Tech. Rep, pages 05--030, 2005."},{"key":"key-10.1145\/3184558.3186240-19","doi-asserted-by":"crossref","unstructured":"M. Newman. Networks: an introduction. Oxford University Press, Inc., 2010.","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001"},{"key":"key-10.1145\/3184558.3186240-20","doi-asserted-by":"crossref","unstructured":"B. Ribeiro and D. Towsley. Estimating and sampling graphs with multidimensional random walks. In Annual conference on Internet measurement, pages 390--403. ACM, 2010.","DOI":"10.1145\/1879141.1879192"},{"key":"key-10.1145\/3184558.3186240-21","doi-asserted-by":"crossref","unstructured":"M. Shokouhi, J. Zobel, F. Scholer, and S. M. M. Tahaghoghi. Capturing collection size for distributed non-cooperative retrieval. In SIGIR, pages 316--323. ACM, 2006.","DOI":"10.1145\/1148170.1148227"},{"key":"key-10.1145\/3184558.3186240-22","doi-asserted-by":"crossref","unstructured":"Y. Wang, J. Liang, and J. Lu. Discover hidden web properties by random walk on bipartite graph. Information Retrieval, 17(3):203--228, 2014.","DOI":"10.1007\/s10791-013-9230-7"}],"event":{"number":"2018","sponsor":["IW3C2, International World Wide Web Conference Committee","SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"acronym":"WWW '18","name":"Companion of the The Web Conference 2018","start":{"date-parts":[[2018,4,23]]},"location":"Lyon, France","end":{"date-parts":[[2018,4,27]]}},"container-title":["Companion of the The Web Conference 2018 on The Web Conference 2018 - WWW '18"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3184558.3186240","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3186240&ftid=1958218&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:26:06Z","timestamp":1750213566000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3184558.3186240"}},"subtitle":[],"proceedings-subject":"The Web Conference 2018","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1145\/3184558.3186240","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}