Sciweavers

2180 search results - page 320 / 436
» Algorithms for discovering bucket orders from data
Sort
View
ML
2002
ACM
141views Machine Learning» more  ML 2002»
15 years 13 days ago
On the Existence of Linear Weak Learners and Applications to Boosting
We consider the existence of a linear weak learner for boosting algorithms. A weak learner for binary classification problems is required to achieve a weighted empirical error on t...
Shie Mannor, Ron Meir
ASUNAM
2010
IEEE
14 years 11 months ago
A Multiobjective and Evolutionary Clustering Method for Dynamic Networks
—The discovery of evolving communities in dynamic networks is an important research topic that poses challenging tasks. Previous evolutionary based clustering methods try to maxi...
Francesco Folino, Clara Pizzuti
105
Voted
BMCBI
2010
155views more  BMCBI 2010»
15 years 27 days ago
A bi-ordering approach to linking gene expression with clinical annotations in gastric cancer
Background: In the study of cancer genomics, gene expression microarrays, which measure thousands of genes in a single assay, provide abundant information for the investigation of...
Fan Shi, Christopher Leckie, Geoff MacIntyre, Izha...
RECOMB
2000
Springer
15 years 4 months ago
Contig selection in physical mapping
In physical mapping, one orders a set of genetic landmarks or a library of cloned fragments of DNA according to their position in the genome. Our approach to physical mapping divi...
Steffen Heber, Jens Stoye, Jörg D. Hoheisel, ...
CVPR
2009
IEEE
16 years 8 months ago
Multiplicative Nonnegative Graph Embedding
In this paper, we study the problem of nonnegative graph embedding, originally investigated in [14] for reaping the benefits from both nonnegative data factorization and the spe...
Changhu Wang (University of Science and Technology...