NetGAN without GAN: From Random Walks to Low-Rank Approximations.
Luca RendsburgHolger HeidrichUlrike von LuxburgPublished in: ICML (2020)
Keyphrases
- random walk
- low rank approximation
- singular value decomposition
- subspace learning
- directed graph
- low rank
- adjacency matrix
- spectral clustering
- kernel matrix
- iterative algorithms
- markov chain
- latent semantic indexing
- link prediction
- nonnegative matrix factorization
- data dependent
- linear combination
- manifold learning
- high dimensional data
- least squares