Sciweavers

77 search results - page 8 / 16
» On the Anonymization of Sparse High-Dimensional Data
Sort
View
ICCV
2011
IEEE
12 years 6 months ago
A Linear Subspace Learning Approach via Sparse Coding
Linear subspace learning (LSL) is a popular approach to image recognition and it aims to reveal the essential features of high dimensional data, e.g., facial images, in a lower di...
Lei Zhang, Pengfei Zhu, Qinghu Hu, David Zhang
TSP
2008
151views more  TSP 2008»
13 years 6 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
CSDA
2007
114views more  CSDA 2007»
13 years 6 months ago
Relaxed Lasso
The Lasso is an attractive regularisation method for high dimensional regression. It combines variable selection with an efficient computational procedure. However, the rate of co...
Nicolai Meinshausen
SDM
2011
SIAM
370views Data Mining» more  SDM 2011»
12 years 9 months ago
Sparse Latent Semantic Analysis
Latent semantic analysis (LSA), as one of the most popular unsupervised dimension reduction tools, has a wide range of applications in text mining and information retrieval. The k...
Xi Chen, Yanjun Qi, Bing Bai, Qihang Lin, Jaime G....
KDD
2001
ACM
187views Data Mining» more  KDD 2001»
14 years 7 months ago
Random projection in dimensionality reduction: applications to image and text data
Random projections have recently emerged as a powerful method for dimensionality reduction. Theoretical results indicate that the method preserves distances quite nicely; however,...
Ella Bingham, Heikki Mannila