Deterministic Coresets for Stochastic Matrices with Applications to Scalable Sparse PageRank
© Springer Nature Switzerland AG 2019. The PageRank algorithm is used by search engines to rank websites in their search results. The algorithm outputs a probability distribution that a person randomly clicking on links will arrive at any particular page. Intuitively, a node in the center of the ne...
Main Authors: | Lang, Harry, Baykal, Cenk, Samra, Najib Abu, Tannous, Tony, Feldman, Dan, Rus, Daniela |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Book |
Language: | English |
Published: |
Springer International Publishing
2021
|
Online Access: | https://hdl.handle.net/1721.1/137195 |
Similar Items
-
On coresets for support vector machines
by: Tukan, Murad, et al.
Published: (2022) -
On Coresets for Support Vector Machines
by: Baykal, Cenk, et al.
Published: (2021) -
Data-dependent coresets for compressing neural networks with applications to generalization bounds
by: Baykal, Cenk, et al.
Published: (2022) -
Dimensionality reduction of massive sparse datasets using coresets
by: Rus, Daniela, et al.
Published: (2021) -
Streaming coreset constructions for M-estimators
by: Braverman, Vladimir, et al.
Published: (2022)