Sciweavers

927 search results - page 84 / 186
» Algorithms for Finding Gene Clusters
Sort
View
ICML
2008
IEEE
16 years 4 months ago
Statistical models for partial membership
We present a principled Bayesian framework for modeling partial memberships of data points to clusters. Unlike a standard mixture model which assumes that each data point belongs ...
Katherine A. Heller, Sinead Williamson, Zoubin Gha...
157
Voted
BMCBI
2011
14 years 10 months ago
RedundancyMiner: De-replication of redundant GO categories in microarray and proteomics analysis
Background: The Gene Ontology (GO) Consortium organizes genes into hierarchical categories based on biological process, molecular function and subcellular localization. Tools such...
Barry Zeeberg, Hongfang Liu, Ari B. Kahn, Martin E...
149
Voted
BMCBI
2010
243views more  BMCBI 2010»
15 years 3 months ago
Comparative study of unsupervised dimension reduction techniques for the visualization of microarray gene expression data
Background: Visualization of DNA microarray data in two or three dimensional spaces is an important exploratory analysis step in order to detect quality issues or to generate new ...
Christoph Bartenhagen, Hans-Ulrich Klein, Christia...
MOBIHOC
2002
ACM
16 years 3 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
113
Voted
CCGRID
2010
IEEE
15 years 4 months ago
A Bi-criteria Algorithm for Scheduling Parallel Task Graphs on Clusters
Applications structured as parallel task graphs exhibit both data and task parallelism, and arise in many domains. Scheduling these applications on parallel platforms has been a lo...
Frédéric Desprez, Frédé...