Fetching the paper…
Reading the bibliography…
The statistical leverage scores of a matrix $A$ are the squared row-norms of the matrix containing its (top) left singular vectors and the coherence is the largest leverage score.
Generalized Inverses and Applications
M.Z. Nashed, editor · 1976
Earlier work this paper cites.
The hat matrix in regression and ANOVA
D.C. Hoaglin and R.E. Welsch · 1978
Earlier work this paper cites.
Efficient computing of regression diagnostics
P.F. Velleman and R.E. Welsch · 1981
Earlier work this paper cites.
Influential observations, high leverage points, and outliers in linear regression
S. Chatterjee and A.S. Hadi · 1986
Earlier work this paper cites.
Power and centrality: A family of measures
P. Bonacich · 1987
Earlier work this paper cites.
Sensitivity Analysis in Linear Regression
S. Chatterjee and A.S. Hadi · 1988
Earlier work this paper cites.
Matrix Computations
G.H. Golub and C.F. Van Loan · 1996
Earlier work this paper cites.
Regression Analysis by Example
S. Chatterjee, A.S. Hadi, and B. Price · 2000
Earlier work this paper cites.
Latent semantic indexing: a probabilistic analysis
C.H. Papadimitriou, P. Raghavan, H. Tamaki, and S. Vempala · 2000
Earlier work this paper cites.
Mining knowledge-sharing sites for viral marketing
M. Richardson and P. Domingos · 2002
Earlier work this paper cites.
Database-friendly random projections: Johnson-lindenstrauss with binary coins
D. Achlioptas · 2003
Earlier work this paper cites.
Data Streams: Algorithms and Applications
S. Muthukrishnan · 2005
Earlier work this paper cites.
A measure of betweenness centrality based on random walks
M.E.J. Newman · 2005
Earlier work this paper cites.
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
N. Ailon and B. Chazelle · 2006
Earlier work this paper cites.
Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication
P. Drineas, R. Kannan, and M.W. Mahoney · 2006
Earlier work this paper cites.
Sampling algorithms for ℓ 2 \ell_{2} regression and applications
P. Drineas, M.W. Mahoney, and S. Muthukrishnan · 2006
Earlier work this paper cites.
Improved approximation algorithms for large matrices via random projections
T. Sarlós · 2006
Cited alongside, same era.
An estimator for the diagonal of a matrix
C. Bekas, E. Kokiopoulou, and Y. Saad · 2007
Cited alongside, same era.
Effective resistance of Gromov-hyperbolic graphs: Application to asymptotic sensor network problems
E. A. Jonckheere, M. Lou, J. Hespanha, and P. Barooah · 2007
Cited alongside, same era.
PCA-correlated SNPs for structure identification in worldwide human populations
P. Paschou, E. Ziv, E.G. Burchard, S. Choudhry, W. Rodriguez-Cintron, M.W. Mahoney, and P. Drineas · 2007
Cited alongside, same era.
Fast dimension reduction using Rademacher series on dual BCH codes
N. Ailon and E. Liberty · 2008
Cited alongside, same era.
Blendenpik: Supercharging LAPACK’s least-squares solver
H. Avron, P. Maymounkov, and S. Toledo · 2010
Later among the works it cites.
A sparse Johnson-Lindenstrauss transform
A. Dasgupta, R. Kumar, and T. Sarlós · 2010
Later among the works it cites.
Inferring geographic coordinates of origin for Europeans using small panels of ancestry informative markers
P. Drineas, J. Lewis, and P. Paschou · 2010
Later among the works it cites.
Faster least squares approximation
P. Drineas, M.W. Mahoney, S. Muthukrishnan, and T. Sarlós · 2010
Later among the works it cites.
Row sampling for matrix algorithms via a non-commutative Bernstein bound
M. Magdon-Ismail · 2010
Later among the works it cites.
1 1 -pass relative-error l p l_{p} -sampling with applications
M. Monemizadeh and D. P. Woodruff · 2010
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
E.J. Candes and B. Recht · 2008
Cited alongside, same era.
Relative-error CUR matrix decompositions
P. Drineas, M.W. Mahoney, and S. Muthukrishnan · 2008
Cited alongside, same era.
Estimating hybrid frequency moments of data streams
S. Ganguly, M. Bansal, and S. Dube · 2008
Cited alongside, same era.
Sketching and streaming entropy via approximation theory
N.J.A. Harvey, J. Nelson, and K. Onak · 2008
Cited alongside, same era.
A fast randomized algorithm for overdetermined linear least-squares regression
V. Rokhlin and M. Tygert · 2008
Cited alongside, same era.
The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
N. Ailon and B. Chazelle · 2009
Cited alongside, same era.
Low cost high performance uncertainty quantification
C. Bekas, A. Curioni, and I. Fedulova · 2009
Cited alongside, same era.
Later among the works it cites.
Ancestry informative markers for fine-scale individual assignment to worldwide populations
P. Paschou, J. Lewis, A. Javed, and P. Drineas · 2010
Later among the works it cites.
Matrix coherence and the Nyström method
A. Talwalkar and A. Rostamizadeh · 2010
Later among the works it cites.
Near-optimal column-based matrix reconstruction
C. Boutsidis, P. Drineas, and M. Magdon-Ismail · 2011
Closest in time.
Near-optimal column-based matrix reconstruction
C. Boutsidis, P. Drineas, and M. Magdon-Ismail · 2011
Closest in time.
Unpublished results, 2011
S. Georgiev and S. Mukherjee · 2011
Closest in time.
Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
N. Halko, P.-G. Martinsson, and J. A. Tropp · 2011
Closest in time.
Randomized algorithms for matrices and data
M. W. Mahoney · 2011
Closest in time.
LSRN: A parallel iterative solver for strongly over- or under-determined systems
X. Meng, M. A. Saunders, and M. W. Mahoney · 2011
Closest in time.
In preparation. (2012)
A. Gittens and M. W. Mahoney · 2012
Closest in time.