Sciweavers

1013 search results - page 39 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
ICML
2010
IEEE
13 years 6 months ago
Multiple Non-Redundant Spectral Clustering Views
Many clustering algorithms only find one clustering solution. However, data can often be grouped and interpreted in many different ways. This is particularly true in the high-dim...
Donglin Niu, Jennifer G. Dy, Michael I. Jordan
BMCBI
2006
120views more  BMCBI 2006»
13 years 7 months ago
An improved distance measure between the expression profiles linking co-expression and co-regulation in mouse
Background: Many statistical algorithms combine microarray expression data and genome sequence data to identify transcription factor binding motifs in the low eukaryotic genomes. ...
Ryung S. Kim, Hongkai Ji, Wing Hung Wong
CSB
2003
IEEE
150views Bioinformatics» more  CSB 2003»
14 years 1 months ago
Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
13 years 9 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar
CVPR
2003
IEEE
14 years 9 months ago
Clustering Appearances of Objects Under Varying Illumination Conditions
We introduce two appearance-based methods for clustering a set of images of 3-D objects, acquired under varying illumination conditions, into disjoint subsets corresponding to ind...
Jeffrey Ho, Ming-Hsuan Yang, Jongwoo Lim, Kuang-Ch...