Semi-supervised learning with regularized Laplacian

References

• R.P. Agaev and P.Y. Chebotarev, Spanning forests of a digraph and their applications, Autom. Remote Control 62(3) (2001), pp. 443–466. doi: 10.1023/A:1002862312617
   Web of Science ®Google Scholar
• R. Andersen, F. Chung, and K. Lang, Local Graph Partitioning Using Pagerank Vectors, Proceedings of IEEE FOCS 2006, Berkeley, 2006, pp. 475–486.
   Google Scholar
• K. Avrachenkov, V. Dobrynin, D. Nemirovsky, S.K. Pham, and E. Smirnova, Pagerank Based Clustering of Hypertext Document Collections, Proceedings of ACM SIGIR 2008, Singapore, 2008, pp. 873–874.
   Google Scholar
• K. Avrachenkov, P. Gonçalves, A. Mishenin, and M. Sokol, Generalized Optimization Framework for Graph-based Semi-Supervised Learning, Proceedings of SIAM Conference on Data Mining (SDM 2012), Vol. 9, Anaheim, 2012.
   Google Scholar
• K. Avrachenkov, P. Gonçalves, and M. Sokol, On the Choice of Kernel and Labelled Data in Semi-supervised Learning Methods, Algorithms and Models for the Web Graph, WAW 2013, LNCS, Vol. 8305, Harvard, Cambridge, 2013, pp. 56–67.
   Google Scholar
• K. Avrachenkov, V. Mazalov, and B. Tsynguev, Beta Current Flow Centrality for Weighted Networks, Proceedings of the 4th International Conference on Computational Social Networks (CSoNet 2015), LNCS 9197, Chapter 19, Bejing, 2015.
   Google Scholar
• D. Blackwell, Discrete dynamic programming, Ann. Math. Stat. 33 (1962), pp. 719–726. doi: 10.1214/aoms/1177704593
   Google Scholar
• J. Callut, K. Françoisse, M. Saerens, and P. Dupont, Semi-Supervised Classification from Discriminative Random Walks, in Machine Learning and Knowledge Discovery in Databases European Conference, ECML PKDD 2008, Antwerp, Belgium, September 15–19, 2008, Proceedings, Part I, Series Lecture Notes in Computer Science/Lecture Notes on Artificial Intelligence, W. Daelemans, B. Goethals, and K. Morik, eds., Vol. 5211. Springer, Berlin, 2008, pp. 162–177.
   Google Scholar
• O. Chapelle, B. Schölkopf, and A Zien, Semi-Supervised Learning, MIT Press, 2006.
   Google Scholar
• P. Yu. Chebotarev, Aggregation of preferences by the generalized row sum method, Math. Soc. Sci. 27 (1994), pp. 293–320. doi: 10.1016/0165-4896(93)00740-L
   Web of Science ®Google Scholar
• P. Chebotarev, Spanning forests and the golden ratio, Discrete Appl. Math. 156(5) (2008), pp. 813–821. doi: 10.1016/j.dam.2007.08.030
   Web of Science ®Google Scholar
• P. Chebotarev, The graph bottleneck identity, Adv. Appl. Math. 47(3) (2011), pp. 403–413. doi: 10.1016/j.aam.2010.11.001
   Web of Science ®Google Scholar
• P. Yu. Chebotarev and E.V. Shamis, The matrix-forest theorem and measuring relations in small social groups, Autom. Remote Control 58(9) (1997), pp. 1505–1514.
   Web of Science ®Google Scholar
• P. Yu. Chebotarev and E.V. Shamis, On a duality between metrics and -proximities, Autom. Remote Control 59(4) (1998), pp. 608–612.
   Web of Science ®Google Scholar
• P. Yu. Chebotarev and E.V. Shamis, On proximity measures for graph vertices, Autom. Remote Control 59(10) (1998), pp. 1443–1459.
   Web of Science ®Google Scholar
• P. Yu. Chebotarev and E.V. Shamis, The forest metrics of a graph and their properties, Autom. Remote Control 61(8) (2000), pp. 1364–1373.
   Web of Science ®Google Scholar
• F. Chung and S.T. Yau, Coverings, heat kernels and spanning trees, Electron. J. Comb. 6 (1999), p. R12.
   Google Scholar
• F. Chung and S.-T Yau, Discrete Green's functions, J. Comb. Theory Ser. A 91(1) (2000), pp. 191–214. doi: 10.1006/jcta.2000.3094
   Web of Science ®Google Scholar
• F. Chung, The heat kernel as the pagerank of a graph, Proc. Natl. Acad. Sci. USA 105(50) (2007), pp. 19735–19740. doi: 10.1073/pnas.0708838104
   Web of Science ®Google Scholar
• F. Chung, A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank, Proceedings of WAW 2009, LNCS 5427, 2009, pp. 62–75.
   Google Scholar
• F. Critchley, On certain linear mappings between inner-product and squared-distance matrices, Linear Algebra Appl. 105 (1988), pp. 91–107. doi: 10.1016/0024-3795(88)90006-7
   Web of Science ®Google Scholar
• M.M. Deza and M. Laurent, Geometry of Cuts and Metrics. Algorithms and Combinatorics, Vol. 15, Springer, Berlin, 1997.
   Google Scholar
• F. Fouss, K. Francoisse, L. Yen, A. Pirotte, and M. Saerens, An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification, Neural Netw. 31 (2012), pp. 53–72. doi: 10.1016/j.neunet.2012.03.001
   PubMed Web of Science ®Google Scholar
• A.V. Dorugade, New ridge parameters for ridge regression, J. Assoc. Arab Univ. Basic Appl. Sci. 15 (2014), pp. 94–99.
   Google Scholar
• S.J. Kirkland, M. Neumann, and B.L. Shader, Distances in weighted trees and group inverse of Laplacian matrices, SIAM J. Matrix Anal. Appl. 18 (1997), pp. 827–841. doi: 10.1137/S0895479896298713
   Web of Science ®Google Scholar
• D.E. Knuth, The Stanford GraphBase: A Platform for Combinatorial Computing, ACM, New York, 1993.
   Google Scholar
• R.I. Kondor and J. Lafferty, Diffusion Kernels on Graphs and Other Discrete Input Spaces, Proceedings of ICML, Vol. 2, Sydney, 2002, pp. 315–322.
   Google Scholar
• G. Muniz and B.M.G. Kibria, On some ridge regression estimators: An empirical comparisons, Commun. Stat. Simul. Comput. 38(3) (2009), pp. 621–630. doi: 10.1080/03610910802592838
   Web of Science ®Google Scholar
• M.E.J. Newman and M. Girvan, Finding and evaluating community structure in networks, Phys. Rev. E 69(2) (2004), pp. 026113. doi: 10.1103/PhysRevE.69.026113
   PubMed Web of Science ®Google Scholar
• M.L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming, John Wiley & Sons, 1994.
   Google Scholar
• H. Scheffé, An analysis of variance for paired comparisons, J. Am. Stat. Assoc. 47(259) (1952), pp. 381–400.
   Web of Science ®Google Scholar
• A.J. Smola and R.I. Kondor, Kernels and Regularization of Graphs, Proceedings of the 16th Annual Conference on Learning Theory, 2003, pp. 144–158.
   Google Scholar
• D. Zhou and C.J.C. Burges, Spectral Clustering and Transductive Learning with Multiple Views, Proceedings of ICML 2007, Corvallis, Oregon, 2007, pp. 1159–1166.
   Google Scholar
• D. Zhou, O. Bousquet, L. Navin, and B. Schölkopf, Learning with local and global consistency, in Advances in Neural Information Processing Systems, Vol. 16, 2004, pp. 321–328.
   Google Scholar
• X. Zhu, Z. Ghahramani, and J. Lafferty, Semi-supervised Learning Using Gaussian Fields and Harmonic Functions, Proceedings of ICML 2003, Vol. 3, Washington, DC, 2003, pp. 912–919.
   Google Scholar
• X. Zhu, Semi-supervised learning literature survey, University of Wisconsin-Madison Research Report TR 1530, 2005.
   Google Scholar
• The NVIDIA CUDA Sparse Matrix Library (cuSPARSE). Available at https://developer.nvidia.com/cuSPARSE.
   Google Scholar