Sciweavers

169 search results - page 6 / 34
» Reductions among high dimensional proximity problems
Sort
View
CORR
2012
Springer
232views Education» more  CORR 2012»
12 years 3 months ago
Smoothing Proximal Gradient Method for General Structured Sparse Learning
We study the problem of learning high dimensional regression models regularized by a structured-sparsity-inducing penalty that encodes prior structural information on either input...
Xi Chen, Qihang Lin, Seyoung Kim, Jaime G. Carbone...
ECCV
2006
Springer
14 years 9 months ago
Sampling Representative Examples for Dimensionality Reduction and Recognition - Bootstrap Bumping LDA
Abstract. We present a novel method for dimensionality reduction and recognition based on Linear Discriminant Analysis (LDA), which specifically deals with the Small Sample Size (S...
Hui Gao, James W. Davis
CVPR
2008
IEEE
14 years 9 months ago
Dimensionality reduction by unsupervised regression
We consider the problem of dimensionality reduction, where given high-dimensional data we want to estimate two mappings: from high to low dimension (dimensionality reduction) and f...
Miguel Á. Carreira-Perpiñán, ...
SDM
2009
SIAM
205views Data Mining» more  SDM 2009»
14 years 4 months ago
Identifying Information-Rich Subspace Trends in High-Dimensional Data.
Identifying information-rich subsets in high-dimensional spaces and representing them as order revealing patterns (or trends) is an important and challenging research problem in m...
Chandan K. Reddy, Snehal Pokharkar
CVPR
2007
IEEE
14 years 9 months ago
Trace Ratio vs. Ratio Trace for Dimensionality Reduction
A large family of algorithms for dimensionality reduction end with solving a Trace Ratio problem in the form of arg maxW Tr(WT SpW)/Tr(WT SlW)1 , which is generally transformed in...
Huan Wang, Shuicheng Yan, Dong Xu, Xiaoou Tang, Th...