7 search results - page 1 / 2 » Robust Clustering in Arbitrarily Oriented Subspaces |
SDM
2008
SIAM
13 years 9 months ago
2008
SIAM
In this paper, we propose an efficient and effective method to find arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set of possi...
SADM
2008
13 years 7 months ago
2008
: In this article, we propose an efficient and effective method for finding arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set o...
ICA
2004
Springer
14 years 1 months ago
2004
Springer
Robust clustering of data into overlapping linear subspaces is a common problem. Here we consider one-dimensional subspaces that cross the origin. This problem arises in blind sour...
SSDBM
2006
IEEE
14 years 1 months ago
2006
IEEE
The detection of correlations between different features in high dimensional data sets is a very important data mining task. These correlations can be arbitrarily complex: One or...
SSDBM
2007
IEEE
14 years 2 months ago
2007
IEEE
In high dimensional data, clusters often only exist in arbitrarily oriented subspaces of the feature space. In addition, these so-called correlation clusters may have complex rela...