Algorithm 4:
Input: (1) Graph G(V, E) |
(2) Matrix of graph nodes representations ΦϵR|V| × d |
Output: Image I1 representing graph |
1: Initialization: Let all pixels of I1 to be zero |
2: Re-organize ? by PCA method |
3: Build a matrix M1 using the first two features of all nodes |
4: for i = 1 to |V| do |
5: x = |
6: y = |
7: Let I1 (x, y) added by 1 |
8: end for |