298 search results - page 26 / 60 » Subspace Clustering of High Dimensional Data |
102
Voted
ICANN
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. In this paper we compare two methods for intrinsic dimensionality (ID) estimation based on optimally topology preserving maps (OTPMs). The rst one is a direct approach, w...
CVPR
2008
IEEE
16 years 2 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...
123
click to vote
EDBT
2000
ACM
15 years 4 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
126
click to vote
NIPS
2001
15 years 1 months ago
2001
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
95
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...