Sciweavers

147 search results - page 4 / 30
» Very sparse random projections
Sort
View
CORR
2010
Springer
181views Education» more  CORR 2010»
13 years 5 months ago
Sparse Recovery with Orthogonal Matching Pursuit under RIP
This paper presents a new analysis for the orthogonal matching pursuit (OMP) algorithm. It is shown that if the restricted isometry property (RIP) is satisfied at sparsity level O...
Tong Zhang
AAAI
2012
11 years 8 months ago
Sparse Probabilistic Relational Projection
Probabilistic relational PCA (PRPCA) can learn a projection matrix to perform dimensionality reduction for relational data. However, the results learned by PRPCA lack interpretabi...
Wu-Jun Li, Dit-Yan Yeung
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
14 years 6 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
CVPR
2011
IEEE
13 years 1 months ago
Accelerated Low-Rank Visual Recovery by Random Projection
Exact recovery from contaminated visual data plays an important role in various tasks. By assuming the observed data matrix as the addition of a low-rank matrix and a sparse matri...
Yadong Mu, Jian Dong, Xiaotong Yuan, Shuicheng Yan
ICML
2009
IEEE
14 years 17 days ago
Sparse higher order conditional random fields for improved sequence labeling
In real sequence labeling tasks, statistics of many higher order features are not sufficient due to the training data sparseness, very few of them are useful. We describe Sparse H...
Xian Qian, Xiaoqian Jiang, Qi Zhang, Xuanjing Huan...