Sciweavers

775 search results - page 23 / 155
» Cone-restricted subspace methods
Sort
View
ICDM
2003
IEEE
184views Data Mining» more  ICDM 2003»
14 years 1 months ago
Analyzing High-Dimensional Data by Subspace Validity
We are proposing a novel method that makes it possible to analyze high dimensional data with arbitrary shaped projected clusters and high noise levels. At the core of our method l...
Amihood Amir, Reuven Kashi, Nathan S. Netanyahu, D...
ICCV
2007
IEEE
14 years 10 months ago
Robust Visual Tracking Based on Incremental Tensor Subspace Learning
Most existing subspace analysis-based tracking algorithms utilize a flattened vector to represent a target, resulting in a high dimensional data learning problem. Recently, subspa...
Xi Li, Weiming Hu, Zhongfei Zhang, Xiaoqin Zhang, ...
FLAIRS
2004
13 years 10 months ago
Random Subspacing for Regression Ensembles
In this work we present a novel approach to ensemble learning for regression models, by combining the ensemble generation technique of random subspace method with the ensemble int...
Niall Rooney, David W. Patterson, Sarab S. Anand, ...
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
14 years 5 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
ICASSP
2008
IEEE
14 years 2 months ago
A weighted subspace approach for improving bagging performance
Bagging is an ensemble method that uses random resampling of a dataset to construct models. In classification scenarios, the random resampling procedure in bagging induces some c...
Qu-Tang Cai, Chun-Yi Peng, Chang-Shui Zhang