Sciweavers

766 search results - page 16 / 154
» Clustering high dimensional data using subspace and projecte...
Sort
View
IJON
2006
169views more  IJON 2006»
13 years 8 months ago
Denoising using local projective subspace methods
In this paper we present denoising algorithms for enhancing noisy signals based on Local ICA (LICA), Delayed AMUSE (dAMUSE) and Kernel PCA (KPCA). The algorithm LICA relies on app...
Peter Gruber, Kurt Stadlthanner, Matthias Böh...
NIPS
2008
13 years 10 months ago
Diffeomorphic Dimensionality Reduction
This paper introduces a new approach to constructing meaningful lower dimensional representations of sets of data points. We argue that constraining the mapping between the high a...
Christian Walder, Bernhard Schölkopf
BMCBI
2008
121views more  BMCBI 2008»
13 years 8 months ago
Microarray data mining using landmark gene-guided clustering
Background: Clustering is a popular data exploration technique widely used in microarray data analysis. Most conventional clustering algorithms, however, generate only one set of ...
Pankaj Chopra, Jaewoo Kang, Jiong Yang, HyungJun C...
ICCSA
2005
Springer
14 years 2 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
ICDM
2002
IEEE
159views Data Mining» more  ICDM 2002»
14 years 1 months ago
O-Cluster: Scalable Clustering of Large High Dimensional Data Sets
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...
Boriana L. Milenova, Marcos M. Campos