298 search results - page 9 / 60 » Subspace Clustering of High Dimensional Data |
113
Voted
SDM
2008
SIAM
15 years 1 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...
108
Voted
SADM
2008
14 years 12 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...
134
Voted
ICDE
2012
IEEE
13 years 2 months ago
2012
IEEE
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
137
Voted
DAWAK
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
121
Voted
SSDBM
2007
IEEE
15 years 6 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...