1313 search results - page 156 / 263 » Dimensionality Reduction for Classification |
149
click to vote
JMLR
2010
14 years 10 months ago
2010
We consider the problem of reducing the dimensionality of labeled data for classification. Unfortunately, the optimal approach of finding the low-dimensional projection with minim...
149
click to vote
CRYPTO
2011
Springer
14 years 3 months ago
2011
Springer
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
138
click to vote
IACR
2011
14 years 2 months ago
2011
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
130
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
This paper addresses feature selection techniques for classification of high dimensional data, such as those produced by microarray experiments. Some prior knowledge may be availa...
116
click to vote
CCIA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. This paper deals with the characterization of data complexity and the relationship with the classification accuracy. We study three dimensions of data complexity: the len...