1. Semi-Supervised Learning With Graphs William Cohen

2. Section outline: SSL and Graphs PageRank - how to scale it RWR/Personalized PageRank – approximate Personalized PageRank plus a “sweep” - extract a subcommunity in a graph, for sampling purposes – RWR for SSL classification of network data MultiRankWalk method “Harmonic field”/wvRN/Co-EM baseline – Modified Adsorption and SSL SSL on graphs as an optimization problem – Unsupervised learning on graphs – Learning on graphs for non-graph datasets unsupervised and semi-supervised

3. MODIFIED ADSORPTION

4. More on SSL on graphs from Partha Talukdar

11. How to do this minimization? First, differentiate to find min is at Jacobi method: To solve Ax=b for x Iterate: … or:

14. Graph: connect each document to its K nearest neighbors