766 search results - page 35 / 154 » Clustering high dimensional data using subspace and projecte... |
ICDE
2003
IEEE
14 years 10 months ago
2003
IEEE
We consider the problem of joining massive datasets. We propose two techniques for minimizing disk I/O cost of join operations for both spatial and sequence data. Our techniques o...
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
Median-shift is a mode seeking algorithm that relies on
computing the median of local neighborhoods, instead of
the mean. We further combine median-shift with Locality
Sensitive...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
We consider the task of dimensionality reduction for regression (DRR) whose goal is to find a low dimensional representation of input covariates, while preserving the statistical ...
CVPR
2004
IEEE
14 years 10 months ago
2004
IEEE
In this paper, we propose a robust model selection criterion for mixtures of subspaces called minimum effective dimension (MED). Previous information-theoretic model selection cri...
ICDM
2007
IEEE
14 years 3 months ago
2007
IEEE
Typical clustering algorithms output a single clustering of the data. However, in real world applications, data can often be interpreted in many different ways; data can have diff...