Sciweavers

683 search results - page 97 / 137
» Generalization Bounds for Learning Kernels
Sort
View
ECML
1998
Springer
14 years 22 days ago
A Monotonic Measure for Optimal Feature Selection
Feature selection is a problem of choosing a subset of relevant features. Researchers have been searching for optimal feature selection methods. `Branch and Bound' and Focus a...
Huan Liu, Hiroshi Motoda, Manoranjan Dash
JAIR
2000
102views more  JAIR 2000»
13 years 8 months ago
A Model of Inductive Bias Learning
A major problem in machine learning is that of inductive bias: how to choose a learner's hypothesis space so that it is large enough to contain a solution to the problem bein...
Jonathan Baxter
COLT
2010
Springer
13 years 6 months ago
Active Learning on Trees and Graphs
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
DAC
2006
ACM
14 years 6 days ago
Refined statistical static timing analysis through
Statistical static timing analysis (SSTA) has been a popular research topic in recent years. A fundamental issue with applying SSTA in practice today is the lack of reliable and e...
Benjamin N. Lee, Li-C. Wang, Magdy S. Abadir
COMPGEOM
2009
ACM
14 years 3 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi