Sciweavers

662 search results - page 7 / 133
» Making inferences with small numbers of training sets
Sort
View
AAAI
2000
13 years 9 months ago
A Quantitative Study of Small Disjuncts
Systems that learn from examples often express the learned concept in the form of a disjunctive description. Disjuncts that correctly classify few training examples are known as s...
Gary M. Weiss, Haym Hirsh
ICCV
2007
IEEE
14 years 9 months ago
Learning 3-D Scene Structure from a Single Still Image
We consider the problem of estimating detailed 3-d structure from a single still image of an unstructured environment. Our goal is to create 3-d models which are both quantitative...
Ashutosh Saxena, Min Sun, Andrew Y. Ng
ACL
2010
13 years 5 months ago
Blocked Inference in Bayesian Tree Substitution Grammars
Learning a tree substitution grammar is very challenging due to derivational ambiguity. Our recent approach used a Bayesian non-parametric model to induce good derivations from tr...
Trevor Cohn, Phil Blunsom
PKDD
2009
Springer
118views Data Mining» more  PKDD 2009»
14 years 2 months ago
Sparse Kernel SVMs via Cutting-Plane Training
We explore an algorithm for training SVMs with Kernels that can represent the learned rule using arbitrary basis vectors, not just the support vectors (SVs) from the training set. ...
Thorsten Joachims, Chun-Nam John Yu
CVPR
2011
IEEE
13 years 3 months ago
Truncated Message Passing
Training of conditional random fields often takes the form of a double-loop procedure with message-passing inference in the inner loop. This can be very expensive, as the need to...
Justin Domke