{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:26:18Z","timestamp":1772295978960,"version":"3.50.1"},"publisher-location":"Boston, MA","reference-count":88,"publisher":"Springer US","isbn-type":[{"value":"9781441984616","type":"print"},{"value":"9781441984623","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-1-4419-8462-3_3","type":"book-chapter","created":{"date-parts":[[2011,3,16]],"date-time":"2011-03-16T12:24:37Z","timestamp":1300278277000},"page":"43-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Random Walks in Social Networks and their Applications: A Survey"],"prefix":"10.1007","author":[{"given":"Purnamrita","family":"Sarkar","sequence":"first","affiliation":[]},{"given":"Andrew W.","family":"Moore","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,3,17]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Lada A. Adamic and Eytan Adar. Friends and neighbors on the web. Social Networks, 25, 2003.","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Alekh Agarwal and Soumen Chakrabarti. Learning random walks to rank nodes in graphs. In ICML \u201907: Proceedings of the 24th international conference on Machine learning, 2007.","DOI":"10.1145\/1273496.1273498"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Alekh Agarwal, Soumen Chakrabarti, and Sunny Aggarwal. Learning to rank networked entities. In KDD \u201906: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, 2006.","DOI":"10.1145\/1150402.1150409"},{"key":"3_CR4","unstructured":"David Aldous and James Allen Fill. Reversible Markov Chains. 2001."},{"key":"3_CR5","unstructured":"Reid Andersen, Fan Chung, and Kevin Lang. Local graph partitioning using pagerank vectors. In FOCS, 2006. ISBN 0-7695-2720-5."},{"key":"3_CR6","unstructured":"Reid Andersen, Fan Chung, and Kevin Lang. Local Partitioning for Directed Graphs Using PageRank. Algorithms and Models for the Web-Graph, 2006."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Arik Azran. The rendezvous algorithm: multiclass semi-supervised learning with markov random walks. In ICML \u201907: Proceedings of the 24th international conference on Machine learning, 2007.","DOI":"10.1145\/1273496.1273503"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Arik Azran and Zoubin Ghahramani. A new approach to data driven clustering. In ICML \u201906: Proceedings of the 23rd international conference on Machine learning, 2006.","DOI":"10.1145\/1143844.1143852"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"A. Balmin, V. Hristidis, and Y. Papakonstantinou. ObjectRank: Authority-based keyword search in databases. In VLDB, 2004.","DOI":"10.1016\/B978-012088469-8.50051-6"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"P. Berkhin. Bookmark-Coloring Algorithm for Personalized PageRank Computing. Internet Mathematics, 2006.","DOI":"10.1080\/15427951.2006.10129116"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Burton H. Bloom. Space\/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7), 1970.","DOI":"10.1145\/362686.362692"},{"key":"3_CR12","unstructured":"D. Boley, G. Ranjan, and Z. Zhang. Commute times for a directed graph using an asymmetric Laplacian. Technical report:10-005, University of Minnesota, 2010."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Allan Borodin, Gareth O. Roberts, Jeffrey S. Rosenthal, and Panayiotis Tsaparas. Finding authorities and hubs from link structures on the world wide web. InWWW\u201901: Proceedings of the 10th international conference on World Wide Web, pages 415\u2013429, New York, NY, USA, 2001. ACM. ISBN 1-58113-348-0.","DOI":"10.1145\/371920.372096"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"M. Brand. A RandomWalks Perspective onMaximizing Satisfaction and Profit. In SIAM \u201905, 2005.","DOI":"10.1137\/1.9781611972757.2"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. In Proc. WWW, 1998.","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"3_CR16","unstructured":"Andrei Z. Broder. On the resemblance and containment of documents. In In Compression and Complexity of Sequences (SEQUENCES\u201997), pages 21\u201329. IEEE Computer Society, 1997."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Andrei Z. Broder, Moses Charikar, Alan M. Frieze, and Michael Mitzenmacher. Min-wise independent permutations (extended abstract). In STOC \u201998: Proceedings of the thirtieth annual ACM symposium on Theory of computing, 1998.","DOI":"10.1145\/276698.276781"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Soumen Chakrabarti. Dynamic personalized pagerank in entity-relation graphs. In Proc. WWW, New York, NY, USA, 2007.","DOI":"10.1145\/1242572.1242650"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Soumen Chakrabarti, Jeetendra Mirchandani, and Arnab Nandi. Spin: searching personal information networks. In SIGIR \u201905: Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval, 2005.","DOI":"10.1145\/1076034.1076186"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"A. K. Chandra, P. Ragha,W. L.van Ruzzo, and R. Smolensky. The electrical resistance of a graph captures its commute and cover times. In STOC, pages 574\u2013586, 1989.","DOI":"10.1145\/73007.73062"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Fan Chung. Laplacians and the cheeger inequality for directed graphs. Annals of Combinatorics, 2005.","DOI":"10.1007\/s00026-005-0237-z"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"K. Collins-Thompson and J. Callan. Query expansion using random walk models. In CIKM \u201905: Proceedings of the 14th ACM international conference on Information and knowledge management, 2005.","DOI":"10.1145\/1099554.1099727"},{"issue":"1","key":"3_CR23","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"Graham Cormode","year":"2005","unstructured":"Graham Cormode and S. Muthukrishnan. An improved data stream summary: the count-min sketch and its applications. J. Algorithms, 55(1): 58\u201375, 2005.","journal-title":"J. Algorithms"},{"issue":"1","key":"3_CR24","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.14778\/1453856.1453982","volume":"1","author":"Bhavana Bharat Dalvi","year":"2008","unstructured":"Bhavana Bharat Dalvi, Meghana Kshirsagar, and S. Sudarshan. Keyword search on external memory data graphs. Proc. VLDB Endow., 1(1):1189\u20131204, 2008.","journal-title":"Proc. VLDB Endow."},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"P. G. Doyle and J. L. Snell. Random Walks and Electric Networks. The Mathematical Assoc. of America., 1984.","DOI":"10.5948\/UPO9781614440222"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Christos Faloutsos, Kevin S. McCurley, and Andrew Tomkins. Fast discovery of connection subgraphs. In KDD \u201904: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, 2004.","DOI":"10.1145\/1014052.1014068"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"D. Fogaras and B. Racz. Scaling link-based similarity search. In Proceedings of the 14th Int\u2019l World Wide Web Conference, 2005.","DOI":"10.1145\/1060745.1060839"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"D. Fogaras, B. Rcz, K. Csalog\u00e1ny, and Tam\u00e1s Sarl\u00f3s. Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments. Internet Mathematics, 2004.","DOI":"10.1007\/978-3-540-30216-2_9"},{"key":"3_CR29","unstructured":"Francois Fouss, Alain Pirotte, Jean michel Renders, and Marco Saerens. A novel way of computing dissimilarities between nodes of a graph, with application to collaborative filtering. In ECML workshop on Statistical Approaches for Web Mining, 2004."},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"David Gibson, Jon Kleinberg, and Prabhakar Raghavan. Clustering categorical data: an approach based on dynamical systems. The VLDB Journal, 8(3-4), 2000.","DOI":"10.1007\/s007780050005"},{"key":"3_CR31","unstructured":"L. Gorelick, M. Galun, E. Sharon, R. Basri, and A. Brandt. Shape representation and classification using the poisson equation. In CVPR, 2004."},{"key":"3_CR32","doi-asserted-by":"publisher","first-page":"857","DOI":"10.2307\/2528823","volume":"27","author":"J.C. Gower","year":"1971","unstructured":"J.C. Gower. A general coefficient of similarity and some of its properties. Biometrics, 27:857\u2013871, 1971.","journal-title":"Biometrics"},{"issue":"11","key":"3_CR33","doi-asserted-by":"publisher","first-page":"1768","DOI":"10.1109\/TPAMI.2006.233","volume":"28","author":"Leo Grady","year":"2006","unstructured":"Leo Grady. Random walks for image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(11):1768\u20131783, 2006. ISSN 0162-8828.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"Leo Grady and Eric L. Schwartz. Isoperimetric graph partitioning for data clustering and image segmentation. In IEEE PAMI, 2006.","DOI":"10.1109\/TPAMI.2006.57"},{"key":"3_CR35","doi-asserted-by":"crossref","unstructured":"Zoltan Gyongyi, Hector Garcia-Molina, and Jan Pedersen. Combating web spam with trustrank. In VLDB\u20192004: Proceedings of the Thirtieth international conference on Very large data bases. VLDB Endowment, 2004.","DOI":"10.1016\/B978-012088469-8\/50052-8"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"David Harel and Yehuda Koren. On clustering using random walks. In Foundations of Software Technology and Theoretical Computer Science 2245. Springer-Verlag, 2001.","DOI":"10.1007\/3-540-45294-X_3"},{"key":"3_CR37","doi-asserted-by":"crossref","unstructured":"T. Haveliwala. Topic-sensitive pagerank. In Proceedings of the Eleventh International World Wide Web Conference, 2002.","DOI":"10.1145\/511446.511513"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Jun Hirai, Sriram Raghavan, Hector Garcia-molina, and Andreas Paepcke. Webbase : A repository of web pages. In In Proceedings of the Ninth International World Wide Web Conference, 2000.","DOI":"10.1016\/S1389-1286(00)00063-3"},{"key":"3_CR39","unstructured":"John Hopcroft and Daniel Sheldon. Manipulation-resistant reputations using hitting time. Technical report, Cornell University, 2007."},{"key":"3_CR40","doi-asserted-by":"crossref","unstructured":"G. Jeh and J. Widom. Scaling personalized web search. In Stanford University Technical Report, 2002.","DOI":"10.1145\/775152.775191"},{"key":"3_CR41","doi-asserted-by":"crossref","unstructured":"Glen Jeh and Jennifer Widom. Simrank: A measure if structural-context similarity. In ACM SIGKDD, 2002.","DOI":"10.1145\/775047.775126"},{"key":"3_CR42","doi-asserted-by":"crossref","unstructured":"Thorsten Joachims. Optimizing search engines using clickthrough data. In KDD \u201902: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, 2002.","DOI":"10.1145\/775047.775067"},{"key":"3_CR43","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/026\/737400","volume":"26","author":"W. Johnson","year":"1984","unstructured":"W. Johnson and J. Lindenstrauss. Extensions of lipschitz maps into a hilbert space. Contemporary Mathematics, 26:189\u2013206, 1984.","journal-title":"Contemporary Mathematics"},{"key":"3_CR44","doi-asserted-by":"crossref","unstructured":"Amruta Joshi, Ravi Kumar, Benjamin Reed, and Andrew Tomkins. Anchor-based proximity measures. In WWW \u201907: Proceedings of the 16th international conference on World Wide Web, 2007.","DOI":"10.1145\/1242572.1242730"},{"key":"3_CR45","doi-asserted-by":"crossref","unstructured":"Sepandar D. Kamvar, Taher H. Haveliwala, Christopher D.Manning, and Gene H. Golub. Extrapolation methods for accelerating pagerank computations. In WWW \u201903: Proceedings of the 12th international conference on World Wide Web, 2003.","DOI":"10.1145\/775152.775190"},{"key":"3_CR46","doi-asserted-by":"crossref","unstructured":"L. Katz. A new status index derived from sociometric analysis. In Psychometrika, 1953.","DOI":"10.1007\/BF02289026"},{"key":"3_CR47","doi-asserted-by":"crossref","unstructured":"Jon M. Kleinberg. Authoritative sources in a hyperlinked environment. J. ACM, 46(5), 1999.","DOI":"10.1145\/324133.324140"},{"key":"3_CR48","doi-asserted-by":"crossref","unstructured":"Yehuda Koren, Stephen C. North, and Chris Volinsky. Measuring and extracting proximity in networks. In KDD \u201906: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, 2006.","DOI":"10.1145\/1150402.1150432"},{"key":"3_CR49","doi-asserted-by":"crossref","unstructured":"John Lafferty and Chengxiang Zhai. Document language models, query models, and risk minimization for information retrieval. In SIGIR \u201901: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval, 2001.","DOI":"10.1145\/383952.383970"},{"key":"3_CR50","doi-asserted-by":"crossref","unstructured":"Amy N. Langville and Carl D. Meyer. Deeper inside pagerank. 2003.","DOI":"10.1080\/15427951.2004.10129091"},{"key":"3_CR51","doi-asserted-by":"crossref","unstructured":"R. Lempel and S. Moran. Salsa: the stochastic approach for link-structure analysis. ACM Trans. Inf. Syst., 19(2), 2001.","DOI":"10.1145\/382979.383041"},{"key":"3_CR52","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1145\/1015706.1015780","volume":"23","author":"Anat Levin","year":"2004","unstructured":"Anat Levin, Dani Lischinski, and Yair Weiss. Colorization using optimization. ACM Transactions on Graphics, 23:689\u2013694, 2004.","journal-title":"ACM Transactions on Graphics"},{"key":"3_CR53","doi-asserted-by":"crossref","unstructured":"David Liben-Nowell and Jon Kleinberg. The link prediction problem for social networks. In CIKM \u201903, 2003.","DOI":"10.1145\/956863.956972"},{"key":"3_CR54","unstructured":"Laszlo Lovasz. Random walks on graphs: a survey. 1996."},{"key":"3_CR55","unstructured":"Qiaozhu Mei, Dengyong Zhou, and Kenneth Church. Query suggestion using hitting time. In CIKM \u201908, pages 469\u2013478, New York, NY, USA, 2008. ACM. ISBN 978-1-59593-991-3."},{"key":"3_CR56","unstructured":"Marina Meila and Jianbo Shi. A random walks view of spectral segmentation. In AISTATS, 2001."},{"key":"3_CR57","doi-asserted-by":"crossref","unstructured":"Einat Minkov, William W. Cohen, and Andrew Y. Ng. Contextual search and name disambiguation in email using graphs. In SIGIR \u201906, 2006.","DOI":"10.3115\/1654758.1654760"},{"key":"3_CR58","doi-asserted-by":"crossref","unstructured":"Marc Najork and Nick Craswell. Efficient and effective link analysis with precomputed SALSA maps. In CIKM \u201908: Proceeding of the 17th ACM conference on Information and knowledge management, 2008.","DOI":"10.1145\/1458082.1458093"},{"key":"3_CR59","doi-asserted-by":"crossref","unstructured":"Marc Najork, Sreenivas Gollapudi, and Rina Panigrahy. Less is more: sampling the neighborhood graph makes SALSA better and faster. In WSDM \u201909: Proceedings of the Second ACM International Conference on Web Search and Data Mining, 2009.","DOI":"10.1145\/1498759.1498832"},{"key":"3_CR60","unstructured":"A. Ng, M. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In Advances in Neural Information Processing Systems, 2001."},{"key":"3_CR61","doi-asserted-by":"crossref","unstructured":"Alexandros Ntoulas, Marc Najork, Mark Manasse, and Dennis Fetterly. Detecting spam web pages through content analysis. In WWW \u201906: Proceedings of the 15th international conference on World Wide Web, 2006.","DOI":"10.1145\/1135777.1135794"},{"key":"3_CR62","unstructured":"Huaijun Qiu and Edwin R. Hancock. Image segmentation using commute times. In Proc. BMVC, 2005."},{"key":"3_CR63","unstructured":"Huaijun Qiu and Edwin R. Hancock. Robust multi-body motion tracking using commute time clustering. In ECCV\u201906, 2006."},{"key":"3_CR64","doi-asserted-by":"crossref","unstructured":"M. Saerens, F. Fouss, L. Yen, and P. Dupont. The principal component analysis of a graph and its relationships to spectral clustering, 2004.","DOI":"10.1007\/978-3-540-30115-8_35"},{"key":"3_CR65","unstructured":"Gerard Salton and Michael J. McGill. Introduction to Modern Information Retrieval. McGraw-Hill, Inc., New York, NY, USA, 1986. ISBN 0070544840."},{"key":"3_CR66","unstructured":"Purnamrita Sarkar and Andrew Moore. A tractable approach to finding closest truncated-commute-time neighbors in large graphs. In Proc. UAI, 2007."},{"key":"3_CR67","doi-asserted-by":"crossref","unstructured":"Purnamrita Sarkar and Andrew Moore. Fast nearest-neighbor search in disk-resident graphs. Technical report, Machine Learning Department, Carnegie Mellon University, 2010.","DOI":"10.1145\/1835804.1835871"},{"key":"3_CR68","doi-asserted-by":"crossref","unstructured":"Purnamrita Sarkar and Andrew W. Moore. Fast dynamic reranking in large graphs. In International World Wide Web Conference, 2009.","DOI":"10.1145\/1526709.1526715"},{"key":"3_CR69","doi-asserted-by":"crossref","unstructured":"Purnamrita Sarkar, AndrewW.Moore, and Amit Prakash. Fast incremental proximity search in large graphs. In Proceedings of the 25th International Conference on Machine Learning, 2008.","DOI":"10.1145\/1390156.1390269"},{"key":"3_CR70","doi-asserted-by":"crossref","unstructured":"Tamas Sarlos, Andras A. Benczur, Karoly Csalogany, Daniel Fogaras, and Balazs Racz. To randomize or not to randomize: space optimal summaries for hyperlink analysis. In WWW, 2006.","DOI":"10.1145\/1135777.1135823"},{"key":"3_CR71","doi-asserted-by":"crossref","unstructured":"Atish Das Sarma, Sreenivas Gollapudi, and Rina Panigrahy. Estimating pagerank on graph streams. In PODS, 2008.","DOI":"10.1145\/1376916.1376928"},{"key":"3_CR72","unstructured":"Jianbo Shi and Jitendra Malik. Normalized cuts and image segmentation. In CVPR \u201997: Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR \u201997), 1997."},{"key":"3_CR73","doi-asserted-by":"crossref","unstructured":"A. Smola and R. Kondor. Kernels and regularization on graphs. In Springer Verlag, editor, Learning Theory and Kernel Machines, 2003.","DOI":"10.1007\/978-3-540-45167-9_12"},{"key":"3_CR74","doi-asserted-by":"crossref","unstructured":"D. Spielman and N. Srivastava. Graph sparsification by effective resistances. In Proceedings of the STOC\u201908, 2008.","DOI":"10.1145\/1374376.1374456"},{"key":"3_CR75","doi-asserted-by":"crossref","unstructured":"D. Spielman and S. Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the STOC\u201904, 2004.","DOI":"10.1145\/1007352.1007372"},{"key":"3_CR76","unstructured":"Martin Szummer and Tommi Jaakkola. Partially labeled classification with markov random walks. In Advances in Neural Information Processing Systems, volume 14, 2001."},{"key":"3_CR77","doi-asserted-by":"crossref","unstructured":"John A. Tomlin. A new paradigm for ranking pages on the world wide web. In WWW \u201903: Proceedings of the 12th international conference on World Wide Web, 2003.","DOI":"10.1145\/775152.775202"},{"key":"3_CR78","doi-asserted-by":"crossref","unstructured":"Hanghang Tong, Yehuda Koren, and Christos Faloutsos. Fast directionaware proximity for graph mining. In ACM SIGKDD, Proceeding of the Internation Conference on Knowledge Discovery and DataMining, 2007.","DOI":"10.1145\/1281192.1281272"},{"key":"3_CR79","doi-asserted-by":"crossref","unstructured":"Kristina Toutanova, Christopher D. Manning, and Andrew Y. Ng. Learning random walk models for inducing word dependency distributions. In ICML \u201904: Proceedings of the twenty-first international conference on Machine learning, 2004.","DOI":"10.1145\/1015330.1015442"},{"key":"3_CR80","doi-asserted-by":"crossref","unstructured":"Panayiotis Tsaparas. Using non-linear dynamical systems for web searching and ranking. In PODS \u201904: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 2004.","DOI":"10.1145\/1055558.1055569"},{"key":"3_CR81","doi-asserted-by":"crossref","unstructured":"Ah Chung Tsoi, Gianni Morini, Franco Scarselli, Markus Hagenbuchner, and Marco Maggini. Adaptive ranking of web pages. In WWW \u201903: Proceedings of the 12th international conference on World Wide Web, 2003.","DOI":"10.1145\/775152.775203"},{"key":"3_CR82","unstructured":"Baoning Wu and Kumar Chellapilla. Extracting link spam using biased random walks from spam seed sets. In WWW, 2007."},{"key":"3_CR83","unstructured":"L. Yen, L. Vanvyve, D. Wouters, F. Fouss, F. Verleysen, and M. Saerens. Clustering using a random-walk based distance measure. In ESANN 2005, pages 317\u2013324, 2005."},{"key":"3_CR84","unstructured":"X. Zhu, Z. Ghahramani, and J. Lafferty. Semi-supervised learning using gaussian fields and harmonic functions. In ICML, volume\n              20, 2003."},{"key":"3_CR85","unstructured":"Xiaojin Zhu. Semi-supervised learning with graphs. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, USA, 2005. Chair-Lafferty, John and Chair-Rosenfeld, Ronald."},{"key":"3_CR86","unstructured":"Xiaojin Zhu. Semi-supervised learning literature survey, 2006."},{"key":"3_CR87","unstructured":"Xiaojin Zhu and John Lafferty. Harmonic mixtures: combining mixture models and graph-based methods for inductive and scalable semisupervised learning. In ICML \u201905: Proceedings of the 22nd international conference on Machine learning, 2005."},{"key":"3_CR88","unstructured":"C. Rao and S.Mitra. Generalized inverse of matrices and its applications. John Wiley and Sons, 1971."}],"container-title":["Social Network Data Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-8462-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T03:16:45Z","timestamp":1676085405000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4419-8462-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9781441984616","9781441984623"],"references-count":88,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-8462-3_3","relation":{},"subject":[],"published":{"date-parts":[[2011]]},"assertion":[{"value":"17 March 2011","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}