Sciweavers

406 search results - page 6 / 82
» Database-friendly random projections
Sort
View
SCL
2008
109views more  SCL 2008»
13 years 7 months ago
A note on linear function approximation using random projections
ABSTRACT: Linear function approximations based on random projections are proposed and justified for a class of fixed point and minimization problems. KEY WORDS: random projections,...
Kishor Barman, Vivek S. Borkar
ICML
2003
IEEE
14 years 8 months ago
Random Projection for High Dimensional Data Clustering: A Cluster Ensemble Approach
We investigate how random projection can best be used for clustering high dimensional data. Random projection has been shown to have promising theoretical properties. In practice,...
Xiaoli Zhang Fern, Carla E. Brodley
INCDM
2007
Springer
97views Data Mining» more  INCDM 2007»
14 years 1 months ago
Clustering by Random Projections
Abstract. Clustering algorithms for multidimensional numerical data must overcome special difficulties due to the irregularities of data distribution. We present a clustering algo...
Thierry Urruty, Chabane Djeraba, Dan A. Simovici
IROS
2009
IEEE
163views Robotics» more  IROS 2009»
14 years 2 months ago
On the performance of random linear projections for sampling-based motion planning
— Sampling-based motion planners are often used to solve very high-dimensional planning problems. Many recent algorithms use projections of the state space to estimate properties...
Ioan Alexandru Sucan, Lydia E. Kavraki
COMPGEOM
2008
ACM
13 years 9 months ago
Tighter bounds for random projections of manifolds
The Johnson-Lindenstrauss random projection lemma gives a simple way to reduce the dimensionality of a set of points while approximately preserving their pairwise distances. The m...
Kenneth L. Clarkson