Sciweavers

766 search results - page 6 / 154
» Clustering high dimensional data using subspace and projecte...
Sort
View
NN
2002
Springer
144views Neural Networks» more  NN 2002»
13 years 8 months ago
Projective ART for clustering data sets in high dimensional spaces
A new neural network architecture (PART) and the resulting algorithm are proposed to
Yongqiang Cao, Jianhong Wu
SSDBM
2006
IEEE
123views Database» more  SSDBM 2006»
14 years 2 months ago
Mining Hierarchies of Correlation Clusters
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...
Elke Achtert, Christian Böhm, Peer Kröge...
ICDM
2002
IEEE
158views Data Mining» more  ICDM 2002»
14 years 1 months ago
Adaptive dimension reduction for clustering high dimensional data
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...
Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Horst...
APBC
2004
121views Bioinformatics» more  APBC 2004»
13 years 10 months ago
Using Emerging Pattern Based Projected Clustering and Gene Expression Data for Cancer Detection
Using gene expression data for cancer detection is one of the famous research topics in bioinformatics. Theoretically, gene expression data is capable to detect all types of early...
Larry T. H. Yu, Fu-Lai Chung, Stephen Chi-fai Chan...
AUSAI
2007
Springer
14 years 2 months ago
DBSC: A Dependency-Based Subspace Clustering Algorithm for High Dimensional Numerical Datasets
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-...
Xufei Wang, Chunping Li