Sciweavers

230 search results - page 14 / 46
» XCS with computed prediction for the learning of Boolean fun...
Sort
View
FOCS
2003
IEEE
14 years 2 months ago
Learning DNF from Random Walks
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell,...
BMCBI
2007
129views more  BMCBI 2007»
13 years 8 months ago
Exploring inconsistencies in genome-wide protein function annotations: a machine learning approach
Background: Incorrectly annotated sequence data are becoming more commonplace as databases increasingly rely on automated techniques for annotation. Hence, there is an urgent need...
Carson M. Andorf, Drena Dobbs, Vasant Honavar
CORR
2010
Springer
76views Education» more  CORR 2010»
13 years 8 months ago
Nonadaptive quantum query complexity
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
Ashley Montanaro
JIB
2006
220views more  JIB 2006»
13 years 8 months ago
An assessment of machine and statistical learning approaches to inferring networks of protein-protein interactions
Protein-protein interactions (PPI) play a key role in many biological systems. Over the past few years, an explosion in availability of functional biological data obtained from hi...
Fiona Browne, Haiying Wang, Huiru Zheng, Francisco...
JMLR
2012
11 years 11 months ago
SpeedBoost: Anytime Prediction with Uniform Near-Optimality
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
Alexander Grubb, Drew Bagnell