4 ms·
Right, RCM assumes a symmetric matrix. Doing something like a single pass of 1d embedding algos like GGVec [1] (note: I wrote the algo, but it's effectively ju
by VHRanger 3y ago
Right, RCM assumes a symmetric matrix.
Doing something like a single pass of 1d embedding algos like GGVec [1] (note: I wrote the algo, but it's effectively just the GLoVe algo for general graphs) or ProNE (if you have enough RAM) are also very cheap computationally
[1] https://github.com/VHRanger/nodevectors https://github.com/VHRanger/nodevectors