Sciweavers

30 search results - page 6 / 6
» Density-Connected Subspace Clustering for High-Dimensional D...
Sort
View
SSDBM
2006
IEEE
123views Database» more  SSDBM 2006»
13 years 11 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...
ICCSA
2005
Springer
13 years 10 months ago
A Penalized Likelihood Estimation on Transcriptional Module-Based Clustering
In this paper, we propose a new clustering procedure for high dimensional microarray data. Major difficulty in cluster analysis of microarray data is that the number of samples to ...
Ryo Yoshida, Seiya Imoto, Tomoyuki Higuchi
IEEEVAST
2010
12 years 11 months ago
Finding and visualizing relevant subspaces for clustering high-dimensional astronomical data using connected morphological opera
Data sets in astronomy are growing to enormous sizes. Modern astronomical surveys provide not only image data but also catalogues of millions of objects (stars, galaxies), each ob...
Bilkis J. Ferdosi, Hugo Buddelmeijer, Scott Trager...
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
14 years 6 months ago
Mining Approximate Order Preserving Clusters in the Presence of Noise
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
Mengsheng Zhang, Wei Wang 0010, Jinze Liu
MM
2005
ACM
122views Multimedia» more  MM 2005»
13 years 10 months ago
Image clustering with tensor representation
We consider the problem of image representation and clustering. Traditionally, an n1 × n2 image is represented by a vector in the Euclidean space Rn1×n2 . Some learning algorith...
Xiaofei He, Deng Cai, Haifeng Liu, Jiawei Han