Sciweavers

107 search results - page 14 / 22
» Dimensionality reduction by unsupervised regression
Sort
View
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
14 years 4 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...
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
14 years 8 months ago
A new multi-view regression approach with an application to customer wallet estimation
Motivated by the problem of customer wallet estimation, we propose a new setting for multi-view regression, where we learn a completely unobserved target (in our case, customer wa...
Srujana Merugu, Saharon Rosset, Claudia Perlich
ICML
2010
IEEE
13 years 8 months ago
Projection Penalties: Dimension Reduction without Loss
Dimension reduction is popular for learning predictive models in high-dimensional spaces. It can highlight the relevant part of the feature space and avoid the curse of dimensiona...
Yi Zhang 0010, Jeff Schneider
SIGIR
2005
ACM
14 years 1 months ago
Multi-label informed latent semantic indexing
Latent semantic indexing (LSI) is a well-known unsupervised approach for dimensionality reduction in information retrieval. However if the output information (i.e. category labels...
Kai Yu, Shipeng Yu, Volker Tresp
PR
2010
170views more  PR 2010»
13 years 6 months ago
Sparsity preserving projections with applications to face recognition
: Dimensionality reduction methods (DRs) have commonly been used as a principled way to understand the high-dimensional data such as face images. In this paper, we propose a new un...
Lishan Qiao, Songcan Chen, Xiaoyang Tan