688 search results - page 78 / 138 » Computing with subspaces |
ECML
2004
Springer
15 years 3 months ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
140
click to vote
KDD
2000
ACM
15 years 1 months ago
2000
ACM
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
110
click to vote
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
Previous studies have demonstrated that the appearance of an object under varying illumination conditions can be represented by a low-dimensional linear subspace. A set of basis i...
AUSAI
2005
Springer
15 years 3 months ago
2005
Springer
All the traditional PCA-based and LDA-based methods are based on the analysis of vectors. So, it is difficult to evaluate the covariance matrices in such a high-dimensional vector ...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Nearest neighbour classifiers and related kernel methods often perform poorly in high dimensional problems because it is infeasible to include enough training samples to cover the...