Fast and Accurate Network Embeddings via Very Sparse Random Projection

2 code implementations • 30 Aug 2019 • Haochen Chen, Syed Fahad Sultan, Yingtao Tian, Muhao Chen, Steven Skiena

Two key features of FastRP are: 1) it explicitly constructs a node similarity matrix that captures transitive relationships in a graph and normalizes matrix entries based on node degrees; 2) it utilizes very sparse random projection, which is a scalable optimization-free method for dimension reduction.

Dimensionality Reduction Network Embedding