{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T07:10:10Z","timestamp":1748589010170,"version":"3.41.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,8,29]],"date-time":"2015-08-29T00:00:00Z","timestamp":1440806400000},"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":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10618-015-0424-z","type":"journal-article","created":{"date-parts":[[2015,8,28]],"date-time":"2015-08-28T05:48:42Z","timestamp":1440740922000},"page":"511-549","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Active exploration for large graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Meng","family":"Fang","sequence":"first","affiliation":[]},{"given":"Jie","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Xingquan","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,29]]},"reference":[{"issue":"2","key":"424_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2601438","volume":"8","author":"N Ahmed","year":"2014","unstructured":"Ahmed N, Neville J, Kompella R (2014) Network sampling: from static to streaming graphs. ACM Trans Knowl Discov Data 8(2):1\u201356","journal-title":"ACM Trans Knowl Discov Data"},{"key":"424_CR2","doi-asserted-by":"crossref","unstructured":"Ahn Y-Y, Han S, Kwak H, Moon S, Jeong H (2007) Analysis of topological characteristics of huge online social networking services. In: Proceedings of the 16th international conference on world wide web, pp 835\u2013844. ACM, Banff, Alberta","DOI":"10.1145\/1242572.1242685"},{"key":"424_CR3","doi-asserted-by":"crossref","unstructured":"Alamgir M, Von Luxburg U (2010) Multi-agent random walks for local clustering on graphs. In: Proceedings of the 10th IEEE international conference on data mining, pp 18\u201327. IEEE, Sydney","DOI":"10.1109\/ICDM.2010.87"},{"key":"424_CR4","doi-asserted-by":"crossref","unstructured":"Alon N, Avin C, Koucky M, Kozma G, Lotker Z, Tuttle MR (2008) Many random walks are faster than one. In: Proceedings of the 20th annual symposium on parallelism in algorithms and architectures, pp. 119\u2013128. ACM, Munich, Germany","DOI":"10.1145\/1378533.1378557"},{"key":"424_CR5","doi-asserted-by":"crossref","unstructured":"Backstrom L, Leskovec J (2011) Supervised random walks: predicting and recommending links in social networks. In: Proceedings of the 4th ACM international conference on web search and data mining, pp 635\u2013644. ACM, Hong Kong","DOI":"10.1145\/1935826.1935914"},{"key":"424_CR6","unstructured":"Becchetti L, Castillo C, Donato D, Fazzone A (2006) A comparison of sampling techniques for web graph characterization. In: Proceedings of the 2006 workshop on link analysis: dynamics and static of large networks, Philadelphia, PA"},{"key":"424_CR7","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1007\/978-3-540-27819-1_43","volume-title":"Learning theory","author":"M Belkin","year":"2004","unstructured":"Belkin M, Matveeva I, Niyogi P (2004) Regularization and semi-supervised learning on large graphs. Learning theory. Springer, Berlin, pp 624\u2013638"},{"key":"424_CR8","doi-asserted-by":"crossref","unstructured":"Bilgic M, Getoor L (2008) Effective label acquisition for collective classification. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, pp 43\u201351. ACM","DOI":"10.1145\/1401890.1401901"},{"key":"424_CR9","unstructured":"Bilgic M, Mihalkova L, Getoor L (2010) Active learning for networked data. In: Proceedings of the 27th international conference on machine learning, pp 79\u201386. Haifa, Israel"},{"key":"424_CR10","doi-asserted-by":"crossref","unstructured":"Catanese S, Meo P, Ferrara E, Fiumara G, Provetti A (2011) Crawling facebook for social network analysis purposes. In: Proceedings of the 1st international conference on web intelligence, mining and semantics, Article No. 52. ACM, Sogndal","DOI":"10.1145\/1988688.1988749"},{"key":"424_CR11","unstructured":"Cesa-Bianchi N, Gentile C, Vitale F, Zappella G (2010) Active learning on trees and graphs. In: Proceedings of the 23rd annual conference on learning theory, pp 320\u2013332. Haifa, Israel"},{"key":"424_CR12","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s P, R\u00e9nyi A (1959) On random graphs I. Publ Math Debrecen 6:290\u2013297","journal-title":"Publ Math Debrecen"},{"key":"424_CR13","doi-asserted-by":"crossref","unstructured":"Fang M, Tao D (2014) Networked bandits with disjoint linear payoffs. In: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 1106\u20131115. ACM","DOI":"10.1145\/2623330.2623672"},{"key":"424_CR14","doi-asserted-by":"crossref","unstructured":"Fang M, Yin J, Zhu X (2013) Active exploration: Simultaneous sampling and labeling for large graphs. In: Proceedings of the 22nd ACM international conference on information and knowledge management, pp 829\u2013834. ACM, Burlingame, CA","DOI":"10.1145\/2505515.2505618"},{"key":"424_CR15","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: Proceedings of the 29th conference on computer communications, pp 1\u20139. San Diego, CA","DOI":"10.1109\/INFCOM.2010.5462078"},{"key":"424_CR16","doi-asserted-by":"crossref","unstructured":"Gkantsidis C, Mihail M, Saberi A (2004) Random walks in peer-to-peer networks. In: Proceedings of the 23rd annual joint conference of the IEEE computer and communications societie, pp 120\u2013130. IEEE","DOI":"10.1109\/INFCOM.2004.1354487"},{"key":"424_CR17","unstructured":"Gyongyi Z, Garcia-Molina H, Pedersen J (2006) Web content categorization using link information. Technical report, Stanford"},{"key":"424_CR18","doi-asserted-by":"crossref","unstructured":"Halperin S, Zwick U (1994) An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM. In: Proceedings of the 6th annual ACM symposium on parallel algorithms and architectures, pp 1\u201310. ACM, Cape May, NJ","DOI":"10.1145\/181014.181017"},{"key":"424_CR19","unstructured":"He J, Carbonell JG, Liu Y (2007) Graph-based semi-supervised learning as a generative model. In: Proceedings of the 20th international joint conference on artificial intelligence, pp 2492\u20132497"},{"issue":"1","key":"424_CR20","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S1389-1286(00)00055-4","volume":"33","author":"MR Henzinger","year":"2000","unstructured":"Henzinger MR, Heydon A, Mitzenmacher M, Najork M (2000) On near-uniform URL sampling. Comput Netw 33(1):295\u2013308","journal-title":"Comput Netw"},{"key":"424_CR21","doi-asserted-by":"crossref","unstructured":"H\u00fcbler C, Kriegel H-P, Borgwardt K, Ghahramani Z (2008) Metropolis algorithms for representative subgraph sampling. In: Proceedings of the 8th IEEE international conference on data mining, pp 283\u2013292. Pisa","DOI":"10.1109\/ICDM.2008.124"},{"key":"424_CR22","doi-asserted-by":"crossref","unstructured":"Karger DR, Nisan N, Parnas M (1992) Fast connected components algorithms for the erew pram. In: Proceedings of the 4th annual ACM symposium on parallel algorithms and architectures, pp 373\u2013381. ACM, San Diego, CA","DOI":"10.1145\/140901.141920"},{"key":"424_CR23","unstructured":"Kuwadekar A, Neville J (2011) Relational active learning for joint collective classification models. In: Proceedings of the 28th international conference on machine learning, pp 385\u2013392. Bellevue, WA"},{"issue":"1","key":"424_CR24","doi-asserted-by":"crossref","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(1):016102","journal-title":"Phys Rev E"},{"key":"424_CR25","doi-asserted-by":"crossref","unstructured":"Leskovec J, Faloutsos C (2006) Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining, pp 631\u2013636. Philadelphia, PA","DOI":"10.1145\/1150402.1150479"},{"key":"424_CR26","doi-asserted-by":"crossref","unstructured":"Lin F, Cohen WW (2010) Semi-supervised classification of network data using very few labels. In: Proceedings of the 2010 international conference on advances in social networks analysis and mining, pp 192\u2013199. IEEE, Adense","DOI":"10.1109\/ASONAM.2010.19"},{"issue":"1","key":"424_CR27","first-page":"1","volume":"2","author":"L Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz L (1993) Random walks on graphs: a survey. Combinatorics 2(1):1\u201346","journal-title":"Combinatorics"},{"key":"424_CR28","unstructured":"Macskassy SA (2007) Improving learning in networked data by combining explicit and mined links. In: Proceedings of the 22nd conference on artificial intelligence, pp. 590\u2013595. AAAI Press, Vancouver, BC"},{"key":"424_CR29","doi-asserted-by":"crossref","unstructured":"Maiya A, Berger-Wolf T (2010) Online sampling of high centrality individuals in social networks. In: Proceedings of the 14th Pacific-Asia conference on knowledge discovery and data mining, pp 91\u201398. Hyderabad, India","DOI":"10.1007\/978-3-642-13657-3_12"},{"key":"424_CR30","doi-asserted-by":"crossref","unstructured":"Mislove A, Koppula H, Gummadi K, Druschel P, Bhattacharjee B (2008) Growth of the flickr social network. In: Proceedings of the 1st workshop on online social networks, pp 25\u201330. ACM, Seattle, WA","DOI":"10.1145\/1397735.1397742"},{"key":"424_CR31","doi-asserted-by":"crossref","unstructured":"Mislove A, Marcon M, Gummadi K, Druschel P, Bhattacharjee B (2007) Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM conference on internet measurement, pp 29\u201342. ACM, San Diego, CA","DOI":"10.1145\/1298306.1298311"},{"key":"424_CR32","unstructured":"Namata G, Sen P, Bilgic M, Getoor L, Sahami M, Srivastava A (2009) Collective classification for text classification. In: Text mining: classification, clustering, and applications. CRC Press, Boca Rotan, pp 51\u201369"},{"key":"424_CR33","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/TKDE.2011.254","volume":"25","author":"M Papagelis","year":"2013","unstructured":"Papagelis M, Das G, Koudas N (2013) Sampling online social networks. IEEE Trans Knowl Data Eng 25:662\u2013676","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"424_CR34","unstructured":"Pfeiffer III J, Neville J, Bennett P (2012) Active sampling of networks. In:Proceedings of the ICML workshop on mining and learning with graphs, Edinburgh, Scotland"},{"key":"424_CR35","doi-asserted-by":"crossref","unstructured":"Rafiei D, Curial S (2005) Effectively visualizing large networks through sampling. In: Proceedings of IEEE visualization, pp 375\u2013382. IEEE, Minneapolis, MN","DOI":"10.1109\/VISUAL.2005.1532819"},{"key":"424_CR36","doi-asserted-by":"crossref","unstructured":"Rasti A, Torkjazi M, Rejaie R, Duffield N, Willinger W, Stutzbach D (2009) Respondent-driven sampling for characterizing unstructured overlays. In: Proceedings of the 28th conference on computer communications, pp 2701\u20132705. IEEE, Rio de Janeiro","DOI":"10.1109\/INFCOM.2009.5062215"},{"issue":"3","key":"424_CR37","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/1970392.1970397","volume":"58","author":"A Sarma","year":"2011","unstructured":"Sarma A, Collapudi S, Panigrahy R (2011) Estimating pagerank on graph streams. J ACM 58(3):13","journal-title":"J ACM"},{"issue":"3","key":"424_CR38","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1609\/aimag.v29i3.2157","volume":"29","author":"P Sen","year":"2008","unstructured":"Sen P, Namata G, Bilgic M, Getoor L, Galligher B, Eliassi-Rad T (2008) Collective classification in network data. AI Mag 29(3):93","journal-title":"AI Mag"},{"key":"424_CR39","doi-asserted-by":"crossref","unstructured":"Stanton I, Kliot G (2012) Streaming graph partitioning for large distributed graphs. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, Beijing","DOI":"10.1145\/2339530.2339722"},{"issue":"2","key":"424_CR40","doi-asserted-by":"crossref","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":"424_CR41","doi-asserted-by":"crossref","unstructured":"Tong H, Faloutsos C, Pan J-Y (2006) Fast random walk with restart and its applications. In: Proceedings of the 6th international conference on data mining, pp 613\u2013622. IEEE","DOI":"10.1109\/ICDM.2006.70"},{"key":"424_CR42","doi-asserted-by":"crossref","unstructured":"Viswanath B, Mislove A, Cha M, Gummadi K (2009) On the evolution of user interaction in facebook. In: Proceedings of the 2nd ACM SIGCOMM workshop on online social networks, pp 37\u201342. ACM, Barcelona","DOI":"10.1145\/1592665.1592675"},{"key":"424_CR43","volume-title":"Social network analysis: methods and applications","author":"S Wasserman","year":"1995","unstructured":"Wasserman S, Faust K (1995) Social network analysis: methods and applications. Cambridge University Press, Cambridge"},{"key":"424_CR44","doi-asserted-by":"crossref","unstructured":"Wilson C, Boe B, Sala A, Puttaswamy K, Zhao B (2009) User interactions in social networks and their implications. In: Proceedings of the 4th ACM European conference on computer systems, pp 205\u2013218. ACM, Nuremberg","DOI":"10.1145\/1519065.1519089"},{"key":"424_CR45","doi-asserted-by":"crossref","unstructured":"Ye S, Lang J, Wu F (2010) Crawling online social graphs. In: Proceedings of the 12th International Asia-Pacific conference on web conference, pp 236\u2013242. IEEE, Busan","DOI":"10.1109\/APWeb.2010.10"},{"issue":"16","key":"424_CR46","first-page":"321","volume":"16","author":"D Zhou","year":"2004","unstructured":"Zhou D, Bousquet O, Lal TN, Weston J, Sch\u00f6lkopf B (2004) Learning with local and global consistency. Adv Neural Inf Process Syst 16(16):321\u2013328","journal-title":"Adv Neural Inf Process Syst"},{"key":"424_CR47","doi-asserted-by":"crossref","unstructured":"Zhou Z, Zhang N, Gong Z, Das G (2013) Faster random walks by rewiring online social networks on-the-fly. In: Proceedings of the 29th IEEE international conference on data engineering, pp 769\u2013780. IEEE, Brisbane","DOI":"10.1109\/ICDE.2013.6544873"},{"key":"424_CR48","unstructured":"Zhu X, Ghahramani Z (2002) Learning from labeled and unlabeled data with label propagation. Technical report, CMU-CALD-02-107, Carnegie Mellon University"},{"key":"424_CR49","unstructured":"Zhu X, Ghahramani Z, Lafferty J (2003) Semi-supervised learning using Gaussian fields and harmonic functions. In: Proceedings of the 20th International Conference on Machine Learning, vol 3, pp 912\u2013919. Washington, DC"},{"key":"424_CR50","unstructured":"Zhu X, Lafferty J, Ghahramani Z (2003) Combining active learning and semi-supervised learning using gaussian fields and harmonic functions. In: Proceedings of the 2003 ICML workshop on the continuum from labeled to unlabeled data in machine learning and data mining, pp 58\u201365. Washington, DC"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-015-0424-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-015-0424-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-015-0424-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T06:44:26Z","timestamp":1748587466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-015-0424-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,29]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["424"],"URL":"https:\/\/doi.org\/10.1007\/s10618-015-0424-z","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2015,8,29]]}}}