Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
row sampling
Description:
A matrix approximation technique that selects a subset of rows, often to reduce computational cost in large-scale data analysis.
Primary topic:
Matrix Theory and Algorithms (21%)
Related topics:
Matrix Theory and Algorithms (21%),
Complexity and Algorithms in Graphs (11%),
Sparse and Compressive Sensing Techniques (11%),
Stochastic Gradient Optimization Techniques (8%)
OpenAlex ID:
keywords/row-sampling
Matrix approximation and projective clustering via volume sampling
2006
·
Amit Deshpande
, Luis Rademacher
, et al.
·
261
Adaptive Sampling and Fast Low-Rank Matrix Approximation
2006
·
Amit Deshpande
, Santosh Vempala
·
Lecture notes in computer science
·
252
L p Row Sampling by Lewis Weights
2015
·
Michael B. Cohen
, Richard Peng
·
ACM Symposium on Theory of Computing (STOC)
·
183
PDF
Improving CUR Matrix Decomposition and the Nyström Approximation via Adaptive Sampling
2013
·
Wang, Shusen
, Zhang, Zhihua
·
arXiv (Cornell University)
·
163
PDF
Optimal Approximate Matrix Product in Terms of Stable Rank
2015
·
Cohen, Michael B.
, Nelson, Jelani
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
134
PDF
Untitled
2006
·
Amit Deshpande
, Luis Rademacher
, et al.
·
Theory of Computing
·
132
PDF
Colibri: fast mining of large static and dynamic graphs
2008
·
Hanghang Tong
, Spiros Papadimitriou
, et al.
·
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
·
123
Single Pass Spectral Sparsification in Dynamic Streams
2014
·
Michael Kapralov
, Yin Tat Lee
, et al.
·
Annual Symposium on Foundations of Computer Science
·
110
Fast Monte-Carlo algorithms for approximate matrix multiplication
2001
·
P. Drineas
, R. Kannan
·
Annual Symposium on Foundations of Computer Science
·
98
Single Pass Spectral Sparsification in Dynamic Streams
2017
·
M. Kapralov
, Y. T. Lee
, et al.
·
SIAM Journal on Computing
·
91
PDF
High Dimensional Low Rank Plus Sparse Matrix Decomposition
2017
·
Mostafa Rahmani
, George K. Atia
·
IEEE Transactions on Signal Processing
·
84
PDF
Random projections for the nonnegative least-squares problem
2009
·
Christos Boutsidis
, Petros Drineas
·
Linear Algebra and its Applications
·
81
PDF
Randomized algorithms in numerical linear algebra
2017
·
Ravindran Kannan
, Santosh Vempala
·
Acta Numerica
·
77
Near Optimal Linear Algebra in the Online and Sliding Window Models
2020
·
Vladimir Braverman
, Petros Drineas
, et al.
·
Annual Symposium on Foundations of Computer Science
·
67
Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
2021
·
Jamie Haddock
, Anna Ma
·
SIAM Journal on Mathematics of Data Science
·
63
PDF
Practical Leverage-Based Sampling for Low-Rank Tensor Decomposition
2022
·
Brett W. Larsen
, Tamara G. Kolda
·
SIAM Journal on Matrix Analysis and Applications
·
62
PDF
Low Rank Matrix-valued Chernoff Bounds and Approximate Matrix Multiplication
2011
·
Avner Magen
, Anastasios Zouzias
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
60
Effect of past soil erosion on crop productivity in Indiana
1989
·
D. L. Schertz
, W. C. Moldenhauer
, et al.
·
Journal of Soil and Water Conservation
·
59
The Effect of Coherence on Sampling from Matrices with Orthonormal Columns, and Preconditioned Least Squares Problems
2014
·
Ilse C. F. Ipsen
, Thomas Wentworth
·
SIAM Journal on Matrix Analysis and Applications
·
49
PDF
Online Row Sampling
2016
·
Cohen, Michael B.
, Musco, Cameron
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
47
PDF
Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds
2015
·
John T. Holodnak
, Ilse C. F. Ipsen
·
SIAM Journal on Matrix Analysis and Applications
·
45
PDF
Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound
2010
·
Magdon-Ismail, Malik
·
arXiv (Cornell University)
·
42
PDF
An Experimental Evaluation of a Monte-Carlo Algorithm for Singular Value Decomposition
2003
·
Petros Drineas
, Eleni Drinea
, et al.
·
Lecture notes in computer science
·
41
A Framework for Analyzing Resparsification Algorithms
2017
·
Rasmus Kyng
, Jakub Pachocki
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
31
A subspace learning approach for high dimensional matrix decomposition with efficient column/row sampling
2016
·
Mostafa Rahmani
, George K. Atia
·
STARS (University of Central Florida)
·
30
Show more works
View as search
Works count:
92
Citation count:
2,799
Year
Topic
Type