Fetching the paper…
Reading the bibliography…
We propose a second-order accurate method to estimate the eigenvectors of extremely large matrices thereby addressing a problem of relevance to statisticians working in the analysis of very large datasets.
Multivariate analysis
Kantilal Varichand Mardia, John T. Kent, and John M. Bibby · 1979
Earlier work this paper cites.
Matrix computation
G.H. Golub and C.F. Van Loan · 1990
Earlier work this paper cites.
An approximation method for eigenvectors of very large matrices
D. J. Groh, R. A. Marshall, A. B. Kunz, and C. R. Givens · 1991
Earlier work this paper cites.
Topics in matrix analysis
R.A. Horn and C.R. Johnson · 1991
Earlier work this paper cites.
Perturbation theory for linear operators
T. Kato · 1995
Earlier work this paper cites.
Concentration of measure and isoperimetric inequalities in product spaces
Michel Talagrand · 1995
Earlier work this paper cites.
Matrix analysis
Rajendra Bhatia · 1997
Earlier work this paper cites.
The pagerank citation ranking: Bringing order to the web
L. Page, S. Brin, R. Motwani, and T. Winograd · 1998
Earlier work this paper cites.
Matrix algorithms
G.W. Stewart · 1998
Earlier work this paper cites.
Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays
A. Alon, N. Barkai, D. A. Notterman, K. Gish, S. Ybarra, D. Mack, and A. J. Levine · 1999
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.
Random graphs
Béla Bollobás · 2001
Earlier work this paper cites.
The elements of statistical learning: data mining, inference, and prediction
T. Hastie, R. Tibshirani, J. Friedman, et al · 2001
Cited alongside, same era.
The concentration of measure phenomenon
M. Ledoux · 2001
Cited alongside, same era.
Stable algorithms for link analysis
A.Y. Ng, A.X. Zheng, and M.I. Jordan · 2001
Cited alongside, same era.
On spectral clustering: Analysis and an algorithm
A. Ng, M. Jordan, and Y. Weiss · 2002
Cited alongside, same era.
An introduction to multivariate statistical analysis
T. W. Anderson · 2003
Cited alongside, same era.
The Second Eigenvalue of the Google Matrix
T.H. Haveliwala and S.D. Kamvar · 2003
Cited alongside, same era.
The WebGraph framework I: Compression techniques
Using pagerank to characterize web structure
G. Pandurangan, P. Raghavan, and E. Upfal · 2006
Later among the works it cites.
Fast computation of low-rank matrix approximations
D. Achlioptas and F. McSherry · 2007
Later among the works it cites.
On rank correlation in information retrieval evaluation
Massimo Melucci · 2007
Later among the works it cites.
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
B. Recht, M. Fazel, and P.A. Parrilo · 2007
Later among the works it cites.
Sampling from large matrices: An approach through geometric functional analysis
Mark Rudelson and Roman Vershynin · 2007
Later among the works it cites.
Spectral norm of random matrices
V.H. Vu · 2007
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Paolo Boldi and Sebastiano Vigna · 2004
Cited alongside, same era.
Fast monte-carlo algorithms for finding low-rank approximations
A. Frieze, R. Kannan, and S. Vempala · 2004
Cited alongside, same era.
Fast parallel PageRank: A linear system approach
D. Gleich, L. Zhukov, and P. Berkhin · 2004
Cited alongside, same era.
A survey of eigenvector methods for web information retrieval
A. N. Langville and C. D. Meyer · 2005
Cited alongside, same era.
The distribution of PageRank follows a power-law only for particular values of the damping factor
L. Becchetti and C. Castillo · 2006
Cited alongside, same era.
Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
P. Drineas, R. Kannan, and M.W. Mahoney · 2006
Cited alongside, same era.
Exact matrix completion via convex optimization
E.J. Candes and B. Recht · 2008
Later among the works it cites.
Spectral Clustering with Perturbed Data
L. Huang, D. Yan, M.I. Jordan, and N. Taft · 2008
Later among the works it cites.
The Power of Convex Relaxation: Near-Optimal Matrix Completion
E.J. Candes and T. Tao · 2009
Closest in time.
Matrix Completion from a Few Entries
R.H. Keshavan, A. Montanari, and S. Oh · 2009
Closest in time.
Spectral algorithms
R. Kannan and S. Vempala · 2009
Closest in time.