The codes for the paper "Learning from labeled and Unlabeled Vertices in Networks" accpeted by KDD 2017. The adjacency matrix of a graph should be a binary matrix with only 1s and 0s, which means edges and non-edges respectively. If you have any questions, please contact Wei Ye (ye@dbs.ifi.lmu.de). Thanks for your interest.
yeweiysh/wvGN
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|