[[1] O. Chapelle, B. Schölkopf, A. Zien, Semi-Supervised Learning, The MIT Press, Cambridge, 2006. ⇒18, 19, 2510.7551/mitpress/9780262033589.001.0001]Search in Google Scholar
[[2] F. Chung, Spectral Graph Theory, volume 92 of Regional Conference Series in Mathematics, AMS, Philadelphia, 1997. ⇒2210.1090/cbms/092]Search in Google Scholar
[[3] J. B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc., 7, 1 (1956) 48–50. ⇒2610.1090/S0002-9939-1956-0078686-7]Search in Google Scholar
[[4] H. Lütkepohl, Handbook of Matrices, John Wiley & Sons, Chichester, 1996. ⇒24]Search in Google Scholar
[[5] U. von Luxburg, A tutorial on spectral clustering, Stat. Comput., 17, 4 (2007) 395–416. ⇒21, 22, 2510.1007/s11222-007-9033-z]Search in Google Scholar
[[6] M. W. Trosset, An Introduction to Statistical Inference and Its Applications with R, Chapman & Hall/CRC Texts in Statistical Science, CRC Press, Boca Raton, 2009. ⇒26]Search in Google Scholar
[[7] X. Zhu, Semi-supervised learning with graphs, PhD thesis, Carnegie Mellon University, Pittsburgh, USA, 2005. ⇒18, 19, 22]Search in Google Scholar
[[8] X. Zhu, Z. Ghahramani, Learning from labeled and unlabeled data with label propagation, Technical Report CMU-CALD-02-107, Carnegie Mellon University, 2002. ⇒18, 19, 20, 26]Search in Google Scholar
[[9] X. Zhu, Z. Ghahramani, J. D. Lafferty, Semi-supervised learning using gaussian fields and harmonic functions, Proc. 20th ICML, 2003. pp. 912–919. ⇒28]Search in Google Scholar