Deterministic Coresets for Stochastic Matrices with Applications to Scalable Sparse PageRank.
Harry LangCenk BaykalNajib Abu SamraTony TannousDan FeldmanDaniela RusPublished in: TAMC (2019)
Keyphrases
- coefficient matrix
- stochastic optimization problems
- sparse matrix
- stochastic methods
- random walk
- high dimensional
- ranking algorithm
- sparse data
- web search
- low rank matrix
- link analysis
- binary matrices
- linear systems
- stochastic model
- highly scalable
- fully observable
- pairwise comparison
- compressed sensing
- social networks
- sparse representation
- black box
- web scale
- low rank