298 search results - page 22 / 60 » Subspace Clustering of High Dimensional Data |
108
Voted
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
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...
162
Voted
CORR
1999
Springer
15 years 3 days ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
83
Voted
DIS
2009
Springer
15 years 7 months ago
2009
Springer
The promotion analysis problem has been proposed in [16], where ranking-based promotion query processing techniques are studied to effectively and efficiently promote a given obje...
121
click to vote
SDM
2007
SIAM
15 years 1 months ago
2007
SIAM
High throughput biotechnologies have enabled scientists to collect a large number of genetic and phenotypic attributes for a large collection of samples. Computational methods are...
93
Voted
IJCV
2008
15 years 13 days ago
2008
For software and more illustrations: http://www.psi.utoronto.ca/anitha/fastTCA.htm Dimensionality reduction techniques such as principal component analysis and factor analysis are...