298 search results - page 25 / 60 » Subspace Clustering of High Dimensional Data |
116
Voted
KDD
2001
ACM
16 years 25 days ago
2001
ACM
Random projections have recently emerged as a powerful method for dimensionality reduction. Theoretical results indicate that the method preserves distances quite nicely; however,...
ICPR
2004
IEEE
16 years 1 months ago
2004
IEEE
We define a cluster to be characterized by regions of high density separated by regions that are sparse. By observing the downward closure property of density, the search for inte...
124
Voted
ICCV
2011
IEEE
14 years 14 days ago
2011
IEEE
Linear subspace learning (LSL) is a popular approach to image recognition and it aims to reveal the essential features of high dimensional data, e.g., facial images, in a lower di...
140
click to vote
VLDB
2000
ACM
15 years 4 months ago
2000
ACM
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
130
click to vote
APVIS
2010
14 years 7 months ago
2010
In this paper, we present a novel three-stage process to visualize the structure of point clouds in arbitrary dimensions. To get insight into the structure and complexity of a dat...