{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T19:33:12Z","timestamp":1777059192131,"version":"3.51.4"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:00:00Z","timestamp":1584489600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:00:00Z","timestamp":1584489600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003693","name":"Korea Institute of Science and Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003693","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003662","name":"Korea Evaluation Institute of Industrial Technology","doi-asserted-by":"publisher","award":["20006489"],"award-info":[{"award-number":["20006489"]}],"id":[{"id":"10.13039\/501100003662","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s10618-020-00683-y","type":"journal-article","created":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T21:02:37Z","timestamp":1584565357000},"page":"905-948","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Guided sampling for large graphs"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2950-4109","authenticated-orcid":false,"given":"Muhammad Irfan","family":"Yousuf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0024-1704","authenticated-orcid":false,"given":"Suhyun","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,18]]},"reference":[{"key":"683_CR1","unstructured":"Ahmed N, Neville J, Kompella RR (2011) Network sampling via edge-based node selection with graph induction. Technical Report 11-016, Purdue Digital Library"},{"key":"683_CR2","doi-asserted-by":"crossref","unstructured":"Ahn Y, Han S, Kwak H, Moon S, Jeong H (2007) Analysis of topological characteristics of huge online social networking services. In: Proceedings of WWW, pp 835\u2013844","DOI":"10.1145\/1242572.1242685"},{"issue":"1","key":"683_CR3","doi-asserted-by":"publisher","first-page":"730","DOI":"10.14778\/1687627.1687710","volume":"2","author":"M Al Hasan","year":"2009","unstructured":"Al Hasan M, Zaki MJ (2009) Output space sampling for graph patterns. Proc VLDB Endow 2(1):730\u2013741","journal-title":"Proc VLDB Endow"},{"issue":"5","key":"683_CR4","doi-asserted-by":"publisher","first-page":"24:1","DOI":"10.1145\/1411509.1411514","volume":"55","author":"Z Bar-Yossef","year":"2008","unstructured":"Bar-Yossef Z, Gurevich M (2008) Random sampling from a search engine\u2019s index. J ACM 55(5):24:1\u201324:74","journal-title":"J ACM"},{"key":"683_CR5","unstructured":"Becchetti L, Castillo C, Donato D, Fazzone A (2006) A comparison of sampling techniques for web graph characterization. In: LinkKDD"},{"key":"683_CR6","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"10","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 10:P10008","journal-title":"J Stat Mech Theory Exp"},{"issue":"4","key":"683_CR7","doi-asserted-by":"publisher","first-page":"308","DOI":"10.2174\/2213275911666180403110851","volume":"10","author":"B Chen","year":"2017","unstructured":"Chen B, Liu L, Jia H, Zhang Y (2017a) Reducing repetition rate: unbiased delay sampling in online social networks. Recent Pat Comput Sci 10(4):308\u2013314","journal-title":"Recent Pat Comput Sci"},{"key":"683_CR8","doi-asserted-by":"crossref","unstructured":"Chen Y, Ding C, Hu J, Chen R, Hui P, Fu X (2017b) Building and analyzing a global co-authorship network using google scholar data. In: Proceedings of 26th international World Wide Web conference (WWW 2017) Companion","DOI":"10.1145\/3041021.3053056"},{"key":"683_CR9","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1109\/TSIPN.2017.2731161","volume":"3","author":"SP Chepuri","year":"2017","unstructured":"Chepuri SP, Leus G (2017) Graph sampling for covariance estimation. IEEE Trans Signal Inf Process Over Netw 3:451\u2013466","journal-title":"IEEE Trans Signal Inf Process Over Netw"},{"key":"683_CR10","doi-asserted-by":"crossref","unstructured":"Chiericetti F, Dasgupta A, Kumar R, Lattanzi S, Sarl\u00f3s T (2016) On sampling nodes in a network. In: Proceedings of the 25th international conference on World Wide Web, WWW \u201916, pp 471\u2013481","DOI":"10.1145\/2872427.2883045"},{"key":"683_CR11","doi-asserted-by":"crossref","unstructured":"Doerr C, Blenn N (2013) Metric convergence in social network sampling. In: ACM Hotplanet","DOI":"10.1145\/2491159.2491168"},{"key":"683_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/rsa.3240060106","volume":"6","author":"U Feige","year":"1995","unstructured":"Feige U (1995) A tight upper bound on the cover time for random walks on graphs. Random Struct Algorithms 6:51\u201354","journal-title":"Random Struct Algorithms"},{"key":"683_CR13","doi-asserted-by":"crossref","unstructured":"Gjoka M, Kurant M, Butts C, Markopoulou A (2010) Walking in facebook: a case study of unbiased sampling of OSNS. In: INFOCOM","DOI":"10.1109\/INFCOM.2010.5462078"},{"issue":"3","key":"683_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.peva.2005.01.002","volume":"63","author":"C Gkantsidis","year":"2006","unstructured":"Gkantsidis C, Mihail M, Saberi A (2006) Random walks in peer-to-peer networks: algorithms and evaluation. Perform Eval 63(3):241\u2013263","journal-title":"Perform Eval"},{"key":"683_CR15","doi-asserted-by":"crossref","unstructured":"Hardiman SJ, Katzir L (2013) Estimating clustering coefficient and size of social networks via random walk. In: ACM\u2019s WWW","DOI":"10.1145\/2488388.2488436"},{"key":"683_CR16","doi-asserted-by":"crossref","unstructured":"Hubler C, Kriegel P, Borgwardt KM, Ghahramani Z (2008) Metropolis algorithms for representative subgraph sampling. In: ICDM","DOI":"10.1109\/ICDM.2008.124"},{"key":"683_CR17","unstructured":"Hu P, Lau WC (2014) A survey and taxonomy of graph sampling. In: HONGKONG UNI"},{"issue":"11","key":"683_CR18","doi-asserted-by":"publisher","first-page":"4079","DOI":"10.1073\/pnas.1318893111","volume":"111","author":"N Kim","year":"2014","unstructured":"Kim N, Laing C, Elmetwaly S, Jung S, Curuksu J, Schlick T (2014) Graph-based sampling for approximating global helical topologies of RNA. Proc Natl Acad Sci 111(11):4079\u20134084","journal-title":"Proc Natl Acad Sci"},{"key":"683_CR19","unstructured":"Konect (2015) Network dataset\u2014KONECT. http:\/\/konect.uni-koblenz.de\/networks\/. Accessed Sept 2018"},{"key":"683_CR20","doi-asserted-by":"crossref","unstructured":"Lee CH, Xu X, Eun DY (2012) Beyond random walk and metropolis\u2013hastings 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, SIGMETRICS \u201912, pp 319\u2013330","DOI":"10.1145\/2254756.2254795"},{"key":"683_CR21","doi-asserted-by":"publisher","first-page":"016102","DOI":"10.1103\/PhysRevE.73.016102","volume":"73","author":"S Lee","year":"2006","unstructured":"Lee S, Kim P, Jeong H (2006) Statistical properties of sampled networks. Phys Rev E 73:016102","journal-title":"Phys Rev E"},{"issue":"1","key":"683_CR22","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data 1(1):2. https:\/\/doi.org\/10.1145\/1217299.1217301","journal-title":"ACM Trans Knowl Discov Data"},{"key":"683_CR23","doi-asserted-by":"crossref","unstructured":"Leskovec J, Faloutsos C (2006) Sampling from large graphs. In: SIGKDD, pp 631\u2013636","DOI":"10.1145\/1150402.1150479"},{"key":"683_CR24","unstructured":"Leskovec J, Krevl A (2014) SNAP datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data. Accessed Sept 2018"},{"issue":"2","key":"683_CR25","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1109\/TCSS.2019.2893889","volume":"6","author":"L Liu","year":"2019","unstructured":"Liu L, Wang L, Wu W, Jia H, Zhang Y (2019) A novel hybrid-jump-based sampling method for complex social networks. IEEE Trans Comput Soc Syst 6(2):241\u2013249","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"683_CR26","doi-asserted-by":"crossref","unstructured":"Li R, Yu JX, Qin L, Mao R, Jin T (2015) On random walk based graph sampling. In: 2015 IEEE 31st international conference on data engineering, pp 927\u2013938","DOI":"10.1109\/ICDE.2015.7113345"},{"key":"683_CR27","doi-asserted-by":"crossref","unstructured":"Maiya AS, Berger-Wolf TY (2010) Sampling community structure. In: Proceedings of the 19th international conference on World Wide Web, WWW \u201910, pp 701\u2013710","DOI":"10.1145\/1772690.1772762"},{"key":"683_CR28","doi-asserted-by":"crossref","unstructured":"Maiya AC, Berger-Wolf TY (2011) Benefits of bias: towards better characterization of network sampling. In: ACM KDD","DOI":"10.1145\/2020408.2020431"},{"key":"683_CR29","doi-asserted-by":"crossref","unstructured":"Najork M, Wiener JL (2001) Breadth-first crawling yields high-quality pages. In: Proceedings of the 10th international conference on World Wide Web, WWW \u201901, pp 114\u2013118","DOI":"10.1145\/371920.371965"},{"key":"683_CR30","doi-asserted-by":"crossref","unstructured":"Rasti AH, Torkjazi M, Rejaie R, Duffield NG, Willinger W, Stutzbach D (2009) Respondent-driven sampling for characterizing unstructured overlays. In: INFOCOM 2009. 28th IEEE international conference on computer communications, 19\u201325 April 2009, Rio de Janeiro, Brazil, pp 2701\u20132705","DOI":"10.1109\/INFCOM.2009.5062215"},{"key":"683_CR31","doi-asserted-by":"crossref","unstructured":"Ribeeiro B, Towsley D (2010) Estimating and sampling graphs with multidimensional random walks. In: ACM internet measurement conference","DOI":"10.1145\/1879141.1879192"},{"key":"683_CR32","unstructured":"Rossi RA, Ahmed NK (2015) The network data repository with interactive graph analytics and visualization. http:\/\/networkrepository.com. Accessed Sept 2018"},{"key":"683_CR33","unstructured":"Sethu H, Chu X (2012) A new algorithm for extracting a small representative subgraph from a very large graph. arXiv:1207.4825"},{"issue":"2","key":"683_CR34","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/TNET.2008.2001730","volume":"17","author":"D Stutzbach","year":"2009","unstructured":"Stutzbach D, Rejaie R, Duffield N, Sen S, Willinger W (2009) On unbiased sampling for unstructured peer-to-peer networks. IEEE\/ACM Trans Netw 17(2):377\u2013390","journal-title":"IEEE\/ACM Trans Netw"},{"key":"683_CR35","doi-asserted-by":"crossref","unstructured":"Voudigari E, Salamanos N, Papageorgiou T, Yannakoudakis EJ (2016) Rank degree: an efficient algorithm for graph sampling. In: 2016 IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM), pp 120\u2013129","DOI":"10.1109\/ASONAM.2016.7752223"},{"key":"683_CR36","doi-asserted-by":"crossref","unstructured":"Wang T, Chen Y, Zhang Z, Sun P, Deng B, Li X (2010) Unbiased sampling in directed social graph. In: Proceedings of the ACM SIGCOMM 2010 conference, SIGCOMM \u201910, pp 401\u2013402","DOI":"10.1145\/1851182.1851231"},{"key":"683_CR37","doi-asserted-by":"crossref","unstructured":"Wang T, Chen Y, Zhang Z, Xu T, Jin L, Hui P, Deng B, Li X (2011) Understanding graph sampling algorithms for social network analysis. In: Proceedings of the 2011 31st international conference on distributed computing systems workshops, ICDCSW \u201911, pp 123\u2013128","DOI":"10.1109\/ICDCSW.2011.34"},{"key":"683_CR38","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2019small-world\u2019 networks. Nature 393:440\u2013442","journal-title":"Nature"},{"key":"683_CR39","doi-asserted-by":"crossref","unstructured":"Xu X, Lee C (2014) A general framework of hybrid graph sampling for complex network analysis. In: Proceedings of INFOCOM","DOI":"10.1109\/INFOCOM.2014.6848229"},{"key":"683_CR40","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.physa.2016.07.055","volume":"463","author":"XK Xu","year":"2016","unstructured":"Xu XK, Zhu JJ (2016) Flexible sampling large-scale social networks by self-adjustable random walk. Phys A: Stat Mech Appl 463:356\u2013365","journal-title":"Phys A: Stat Mech Appl"},{"key":"683_CR41","doi-asserted-by":"crossref","unstructured":"Xu X, Lee CH et al (2017) Challenging the limits: sampling online social networks with cost constraints. In: IEEE INFOCOM 2017-IEEE conference on computer communications, pp 1\u20139","DOI":"10.1109\/INFOCOM.2017.8057169"},{"key":"683_CR42","doi-asserted-by":"crossref","unstructured":"Ye S, Lang J, Wu F (2010) Crawling online social graphs. In: Proceedings of the 2010 12th international Asia-Pacific web conference, pp 236\u2013242","DOI":"10.1109\/APWeb.2010.10"},{"key":"683_CR43","unstructured":"Zafarani R, Liu H (2009) Social computing data repository at ASU. School of Computing, Informatics and Decision Systems Engineering"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-020-00683-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-020-00683-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-020-00683-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,18]],"date-time":"2021-03-18T00:18:28Z","timestamp":1616026708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-020-00683-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,18]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["683"],"URL":"https:\/\/doi.org\/10.1007\/s10618-020-00683-y","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,18]]},"assertion":[{"value":"17 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}