Sciweavers

1385 search results - page 3 / 277
» Clustering by Random Projections
Sort
View
ICML
2009
IEEE
14 years 6 months ago
Multi-view clustering via canonical correlation analysis
Clustering data in high dimensions is believed to be a hard problem in general. A number of efficient clustering algorithms developed in recent years address this problem by proje...
Kamalika Chaudhuri, Sham M. Kakade, Karen Livescu,...
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
14 years 3 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
MCS
2007
Springer
14 years 5 days ago
Selecting Diversifying Heuristics for Cluster Ensembles
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...
Stefan Todorov Hadjitodorov, Ludmila I. Kuncheva
ITA
2006
167views Communications» more  ITA 2006»
13 years 6 months ago
Characterization of lung tumor subtypes through gene expression cluster validity assessment
The problem of assessing the reliability of clusters patients identified by clustering algorithms is crucial to estimate the significance of subclasses of diseases detectable at b...
Giorgio Valentini, Francesca Ruffino
BMCBI
2007
128views more  BMCBI 2007»
13 years 6 months ago
Model order selection for bio-molecular data clustering
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
Alberto Bertoni, Giorgio Valentini