Sciweavers

903 search results - page 16 / 181
» On the reduction of a random basis
Sort
View
KDD
2003
ACM
127views Data Mining» more  KDD 2003»
16 years 2 months ago
Experiments with random projections for machine learning
Dimensionality reduction via Random Projections has attracted considerable attention in recent years. The approach has interesting theoretical underpinnings and offers computation...
Dmitriy Fradkin, David Madigan
AI
2005
Springer
15 years 7 months ago
Comparing Dimension Reduction Techniques for Document Clustering
In this research, a systematic study is conducted of four dimension reduction techniques for the text clustering problem, using five benchmark data sets. Of the four methods -- Ind...
Bin Tang, Michael A. Shepherd, Malcolm I. Heywood,...
106
Voted
STACS
2009
Springer
15 years 8 months ago
Generating Shorter Bases for Hard Random Lattices
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
Joël Alwen, Chris Peikert
104
Voted
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
15 years 3 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
EDBT
2010
ACM
132views Database» more  EDBT 2010»
15 years 5 months ago
Turbo-charging hidden database samplers with overflowing queries and skew reduction
Recently, there has been growing interest in random sampling from online hidden databases. These databases reside behind form-like web interfaces which allow users to execute sear...
Arjun Dasgupta, Nan Zhang 0004, Gautam Das