436 search results - page 8 / 88 » Automatic Subspace Clustering of High Dimensional Data for D... |
KDD
2004
ACM
14 years 8 months ago
2004
ACM
Traditional clustering is a descriptive task that seeks to identify homogeneous groups of objects based on the values of their attributes. While domain knowledge is always the bes...
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...
PKDD
2009
Springer
14 years 2 months ago
2009
Springer
Most existing semi-supervised learning methods are based on the smoothness assumption that data points in the same high density region should have the same label. This assumption, ...
SIGMOD
2000
ACM
13 years 12 months ago
2000
ACM
Clustering is one of the most important tasks performed in Data Mining applications. This paper presents an e cient SQL implementation of the EM algorithm to perform clustering in...
ICDM
2002
IEEE
14 years 17 days ago
2002
IEEE
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...