On the feasibility of low-rank approximation for personalized PageRank.
András A. BenczúrKároly CsalogányTamás SarlósPublished in: WWW (Special interest tracks and posters) (2005)
Keyphrases
- low rank approximation
- low rank matrix approximation
- singular value decomposition
- low rank
- subspace learning
- spectral clustering
- kernel matrix
- random walk
- adjacency matrix
- data dependent
- matrix completion
- iterative algorithms
- information retrieval
- dimensionality reduction
- latent semantic indexing
- reconstruction error
- high dimensional data
- high dimensional