Sciweavers

3818 search results - page 130 / 764
» Learning from Order Examples
Sort
View
COLT
1998
Springer
15 years 4 months ago
Self Bounding Learning Algorithms
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
Yoav Freund
CORR
2010
Springer
130views Education» more  CORR 2010»
14 years 10 months ago
Interactive Learning Based Realizability and 1-Backtracking Games
Abstract. We prove that interactive learning based classical realizability (introduced by Aschieri and Berardi for first order arithmetic [1]) is sound with respect to Coquand game...
Federico Aschieri
GECCO
2003
Springer
182views Optimization» more  GECCO 2003»
15 years 5 months ago
Spatial Operators for Evolving Dynamic Bayesian Networks from Spatio-temporal Data
Learning Bayesian networks from data has been studied extensively in the evolutionary algorithm communities [Larranaga96, Wong99]. We have previously explored extending some of the...
Allan Tucker, Xiaohui Liu, David Garway-Heath
CVPR
2008
IEEE
16 years 2 months ago
Semi-supervised SVM batch mode active learning for image retrieval
Active learning has been shown as a key technique for improving content-based image retrieval (CBIR) performance. Among various methods, support vector machine (SVM) active learni...
Steven C. H. Hoi, Rong Jin, Jianke Zhu, Michael R....
ICML
2009
IEEE
15 years 7 months ago
Learning linear dynamical systems without sequence information
Virtually all methods of learning dynamic systems from data start from the same basic assumption: that the learning algorithm will be provided with a sequence, or trajectory, of d...
Tzu-Kuo Huang, Jeff Schneider