Sciweavers

2137 search results - page 99 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
CSDA
2008
128views more  CSDA 2008»
13 years 10 months ago
Assessing agreement of clustering methods with gene expression microarray data
In the rapidly evolving field of genomics, many clustering and classification methods have been developed and employed to explore patterns in gene expression data. Biologists face...
Xueli Liu, Sheng-Chien Lee, George Casella, Gary F...
BMCBI
2010
164views more  BMCBI 2010»
13 years 8 months ago
Merged consensus clustering to assess and improve class discovery with microarray data
Background: One of the most commonly performed tasks when analysing high throughput gene expression data is to use clustering methods to classify the data into groups. There are a...
T. Ian Simpson, J. Douglas Armstrong, Andrew P. Ja...
PPOPP
2009
ACM
14 years 11 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
ICCV
2003
IEEE
15 years 17 days ago
Graph Partition by Swendsen-Wang Cuts
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
Adrian Barbu, Song Chun Zhu
SIAMSC
2008
182views more  SIAMSC 2008»
13 years 10 months ago
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
Pratik Biswas, Kim-Chuan Toh, Yinyu Ye