Contact and support
Need help, have a question, or want to contact the ResearchHub team?
© 2026 ResearchHub. Built for responsible scholarly connection.
Privacy-aware community infrastructureMichael W. Mahoney
Abstract
Authors
Institutions
No ROR-resolved institution is linked to this work yet.
Provenance
crossref
Confidence 100%
unpaywall
Confidence 95%
datacite
Confidence 0%
No local reference links have been materialized yet.
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
10.1016/s0022-0000(03)00025-4 · 2003
Fast computation of low-rank matrix approximations
10.1145/1219092.1219097 · 2007
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
2006
The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
10.1137/060673096 · 2009
Faster dimension reduction
10.1145/1646353.1646379 · 2010
Fast dimension reduction using Rademacher series on dual BCH codes
2008
An almost optimal unrestricted fast Johnson-Lindenstrauss transform
2011
Singular value decomposition for genome-wide expression data processing and modeling
10.1073/pnas.97.18.10101 · 2000
Blendenpik: Supercharging LAPACK’s least-squares solver
10.1137/090767911 · 2010
Unresolved referenced work
2008
Data mining and machine learning in astronomy
10.1142/s0218271810017160 · 2010
Galaxy types in the Sloan Digital Sky Survey using supervised artificial neural networks
10.1111/j.1365-2966.2004.07429.x · 2004
On the spectrum of the normalized graph Laplacian
10.1016/j.laa.2008.01.029 · 2008
Graph spectra as a systematic tool in computational biology
10.1016/j.dam.2008.06.033 · 2009
Graph effective resistances and distributed control: Spectral properties and applications
10.1109/cdc.2006.377619 · 2006
An estimator for the diagonal of a matrix
10.1016/j.apnum.2007.01.003 · 2007
Fast low-rank approximation for covariance matrices
2007
On sparse representations of linear operators and the approximation of matrix products
2008
On landmark selection and sampling in high-dimensional data analysis
10.1098/rsta.2009.0161 · 2009
Spectral methods in machine learning and new strategies for very large datasets
10.1073/pnas.0810600105 · 2009
On the approximation of matrix products and positive definite matrices
2007
Email surveillance using non-negative matrix factorization
10.1007/s10588-005-5380-5 · 2005
Unresolved referenced work
2004
Random projection in dimensionality reduction: Applications to image and text data
2001
Structure-preserving and rank-revealing QR-factorizations
10.1137/0912073 · 1991
Algorithm 782: Codes for rank-revealing QR factorizations of dense matrices
10.1145/290200.287638 · 1998
Computing rank-revealing QR factorizations of dense matrices
10.1145/290200.287637 · 1998
Power and centrality: A family of measures
10.1086/228631 · 1987
Exploring the spectral space of low redshift QSOs
10.1088/0004-6256/140/2/390 · 2010
An improved approximation algorithm for the column subset selection problem
2008
Unsupervised feature selection for principal components analysis
2008
Unsupervised feature selection for the k-means clustering problem
2009
An improved approximation algorithm for the column subset selection problem
2009
Diffusion in a sparsely connected space: A model for glassy relaxation
10.1103/physrevb.38.11461 · 1988
Subset selection algorithms: Randomized vs. deterministic
Kept as external metadata until matched
10.1007/978-1-4615-0005-6_27
10.1007/978-1-4615-0005-6_27 · 2002
Reliable eigen-spectra for new generation surveys
10.1111/j.1365-2966.2009.14415.x · 2009
Linear least squares solutions by Householder transformations
10.1007/bf01436084 · 1965
Fast computation of Fourier integral operators
10.1137/060671139 · 2007
Sparsity and incoherence in compressive sampling
10.1088/0266-5611/23/3/008 · 2007
Improved Nyström low-rank approximation and error analysis
10.1145/1390156.1390311 · doi-reference
Clustered Nyström method for large scale manifold learning and dimension reduction
10.1109/tnn.2010.2064786 · doi-reference
An information flow model for conflict and fission in small groups
10.1086/jar.33.4.3629752 · doi-reference
Spectral classification of quasars in the Sloan Digital Sky Survey: Eigenspectra, redshift, and luminosity effects
10.1086/425626 · doi-reference
Distributions of galaxy spectral types in the Sloan Digital Sky Survey
10.1086/422429 · doi-reference
A fast randomized algorithm for the approximation of matrices
10.1016/j.acha.2007.12.002 · doi-reference
10.1007/0-306-47815-3_5
10.1007/0-306-47815-3_5 · doi-reference
Efficient computing of regression diagnostics
10.1080/00031305.1981.10479362 · doi-reference
Genome-wide association study of 14,000 cases of seven common diseases and 3,000 shared controls
10.1038/nature05911 · doi-reference
A haplotype map of the human genome
10.1038/nature04226 · doi-reference
The International HapMap Project
10.1038/nature02168 · doi-reference
A global geometric framework for nonlinear dimensionality reduction
10.1126/science.290.5500.2319 · doi-reference
Less is more: Compact matrix decomposition for large sparse graphs
10.1137/1.9781611972771.33 · doi-reference
Four algorithms for efficient computation of truncated QR approximations to a sparse matrix
10.1007/s002110050451 · doi-reference
Clustered low rank approximation of graphs in information science applications
10.1137/1.9781611972818.15 · doi-reference
10.7551/mitpress/6173.003.0022
10.7551/mitpress/6173.003.0022 · doi-reference
Numerical methods for electronic structure calculations of materials
10.1137/060651653 · doi-reference
Sampling from large matrices: An approach through geometric functional analysis
10.1145/1255443.1255449 · doi-reference
Random vectors in isotropic position
10.1006/jfan.1998.3384 · doi-reference
Nonlinear dimensionality reduction by local linear embedding
10.1126/science.290.5500.2323 · doi-reference
A fast randomized algorithm for overdetermined linear least-squares regression
10.1073/pnas.0804869105 · doi-reference
A randomized algorithm for principal component analysis
10.1137/080736417 · doi-reference
Density of states of a sparse random matrix
10.1103/physrevb.37.3557 · doi-reference
Population structure and eigenanalysis
10.1371/journal.pgen.0020190 · doi-reference
PCA-correlated SNPs for structure identification in worldwide human populations
10.1371/journal.pgen.0030160 · doi-reference
Intra-and interpopulation genotype reconstruction from tagging SNPs
10.1101/gr.5741407 · doi-reference
Tracing sub-structure in the European American population with PCA-informative markers
10.1371/journal.pgen.1000114 · doi-reference
Latent semantic indexing: A probabilistic analysis
10.1006/jcss.2000.1711 · doi-reference
Bounds on singular values revealed by QR factorizations
10.1023/a:1022395308695 · doi-reference
On the existence and computation of rank-revealing LU factorizations
10.1016/s0024-3795(00)00120-8 · doi-reference
Algorithm 583: LSQR: Sparse linear equations and least-squares problems
10.1145/355993.356000 · doi-reference
Genes mirror geography within Europe
10.1038/nature07331 · doi-reference
A measure of betweenness centrality based on random walks
10.1016/j.socnet.2004.11.009 · doi-reference
10.1561/9781933019604
10.1561/9781933019604 · doi-reference
10.1017/cbo9780511814075
10.1017/cbo9780511814075 · doi-reference
Spectral and dynamical properties in classes of sparse networks with mesoscopic inhomogeneities
10.1103/physreve.80.026123 · doi-reference
Universality of level correlation function of sparse random matrices
10.1088/0305-4470/24/10/016 · doi-reference
Equation of state calculations by fast computing machines
10.1063/1.1699114 · doi-reference
Synthetic maps of human gene frequencies in Europeans
10.1126/science.356262 · doi-reference
Selection of genetic markers for association analyses, using linkage disequilibrium and haplotypes
10.1086/376561 · doi-reference
