766 search results - page 7 / 154 » Clustering high dimensional data using subspace and projecte... |
CVPR
2004
IEEE
14 years 10 months ago
2004
IEEE
We consider the problem of segmenting multiple rigid motions from point correspondences in multiple affine views. We cast this problem as a subspace clustering problem in which th...
ICPR
2004
IEEE
14 years 9 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...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
Abstract The notorious "dimensionality curse" is a wellknown phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well-known approa...
KDD
2001
ACM
14 years 9 months ago
2001
ACM
In this paper we present a method for clustering SAGE (Serial Analysis of Gene Expression) data to detect similarities and dissimilarities between different types of cancer on the...
DIS
2006
Springer
14 years 8 days ago
2006
Springer
Parametric Embedding (PE) has recently been proposed as a general-purpose algorithm for class visualisation. It takes class posteriors produced by a mixture-based clustering algori...