2137 search results - page 132 / 428 » Experiments on Graph Clustering Algorithms |
CSB
2004
IEEE
15 years 1 months ago
2004
IEEE
The soundness of clustering in the analysis of gene expression profiles and gene function prediction is based on the hypothesis that genes with similar expression profiles may imp...
99
Voted
PR
2008
14 years 9 months ago
2008
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
106
click to vote
ICANN
2009
Springer
14 years 7 months ago
2009
Springer
Different algorithms have been proposed in the literature to cluster gene expression data, however there is no single algorithm that can be considered the best one independently on...
DDECS
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—In Network-on-Chip (NoC) application design, coreto-node mapping is an important but intractable optimization problem. In the paper, we use simulated annealing to tackle...
EDBT
2004
ACM
15 years 10 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...