885 search results - page 1 / 177 » Random Matrices in Data Analysis |
PKDD
2004
Springer
13 years 10 months ago
2004
Springer
We show how carefully crafted random matrices can achieve distance-preserving dimensionality reduction, accelerate spectral computations, and reduce the sample complexity of certai...
233
click to vote
Lecture Notes
Easy to follow lecture notes on Computational Physics.
GI
2009
Springer
13 years 2 months ago
2009
Springer
: The task of tracking extended objects or (partly) unresolvable group targets raises new challenges for both data association and track maintenance. Due to limited sensor resoluti...
ICDM
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...