Sciweavers

2190 search results - page 19 / 438
» Learning with the Set Covering Machine
Sort
View
COLT
2006
Springer
13 years 11 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
ICML
2000
IEEE
14 years 8 months ago
Discovering Test Set Regularities in Relational Domains
Machine learning typically involves discovering regularities in a training set, then applying these learned regularities to classify objects in a test set. In this paper we presen...
Seán Slattery, Tom M. Mitchell
COLT
2005
Springer
14 years 1 months ago
Generalization Error Bounds Using Unlabeled Data
We present two new methods for obtaining generalization error bounds in a semi-supervised setting. Both methods are based on approximating the disagreement probability of pairs of ...
Matti Kääriäinen
BMCBI
2010
176views more  BMCBI 2010»
13 years 7 months ago
TargetSpy: a supervised machine learning approach for microRNA target prediction
Background: Virtually all currently available microRNA target site prediction algorithms require the presence of a (conserved) seed match to the 5' end of the microRNA. Recen...
Martin Sturm, Michael Hackenberg, David Langenberg...
KDD
2002
ACM
108views Data Mining» more  KDD 2002»
14 years 8 months ago
Incremental Machine Learning to Reduce Biochemistry Lab Costs in the Search for Drug Discovery
This paper promotes the use of supervised machine learning in laboratory settings where chemists have a large number of samples to test for some property, and are interested in id...
George Forman