30 search results - page 5 / 6 » Density-Connected Subspace Clustering for High-Dimensional D... |
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...
113
Voted
ICPP
2000
IEEE
15 years 2 months ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
KDD
2001
ACM
15 years 10 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...
66
Voted
BIOINFORMATICS
2006
14 years 10 months ago
2006
Summary: We present a new R package for the assessment of the reliability of clusters discovered in high dimensional DNA microarray data. The package implements methods based on r...
101
Voted
SSDBM
2007
IEEE
15 years 4 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...