298 search results - page 5 / 60 » Subspace Clustering of High Dimensional Data |
192
Voted
ICDE
2003
IEEE
15 years 11 months ago
2003
IEEE
The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well known approach to o...
84
Voted
MLDM
2005
Springer
15 years 3 months ago
2005
Springer
Subspace clustering is an extension of traditional clustering that seeks to find clusters in different subspaces within a dataset. This is a particularly important challenge with...
111
Voted
WIRN
2005
Springer
15 years 3 months ago
2005
Springer
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
AUSAI
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We present a novel algorithm called DBSC, which finds subspace clusters in numerical datasets based on the concept of ”dependency”. This algorithm employs a depth-...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of deciding whether a highly incomplete signal lies within a given subspace. This problem, Matched Subspace Detection, is a classical, wellstudied problem w...