Sciweavers

1038 search results - page 51 / 208
» A Genetic Algorithm for Clustering on Very Large Data Sets
Sort
View
BMCBI
2007
123views more  BMCBI 2007»
13 years 8 months ago
Robust clustering in high dimensional data using statistical depths
Background: Mean-based clustering algorithms such as bisecting k-means generally lack robustness. Although componentwise median is a more robust alternative, it can be a poor cent...
Yuanyuan Ding, Xin Dang, Hanxiang Peng, Dawn Wilki...
PAMI
2011
13 years 3 months ago
Parallel Spectral Clustering in Distributed Systems
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
Wen-Yen Chen, Yangqiu Song, Hongjie Bai, Chih-Jen ...
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
14 years 9 months ago
Robust information-theoretic clustering
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
Christian Böhm, Christos Faloutsos, Claudia P...
TCSB
2008
13 years 8 months ago
Clustering Time-Series Gene Expression Data with Unequal Time Intervals
Clustering gene expression data given in terms of time-series is a challenging problem that imposes its own particular constraints, namely exchanging two or more time points is not...
Luis Rueda, Ataul Bari, Alioune Ngom
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
14 years 10 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou