Sciweavers

3204 search results - page 349 / 641
» Online Learning with Constraints
Sort
View
FLAIRS
2007
15 years 9 months ago
Random Subsets Support Learning a Mixture of Heuristics
Problem solvers, both human and machine, have at their disposal many heuristics that may support effective search. The efficacy of these heuristics, however, varies with the probl...
Smiljana Petrovic, Susan L. Epstein
ACL
2006
15 years 8 months ago
Relation Extraction Using Label Propagation Based Semi-Supervised Learning
Shortage of manually labeled data is an obstacle to supervised relation extraction methods. In this paper we investigate a graph based semi-supervised learning algorithm, a label ...
Jinxiu Chen, Dong-Hong Ji, Chew Lim Tan, Zheng-Yu ...
JAIR
2002
120views more  JAIR 2002»
15 years 6 months ago
Learning Geometrically-Constrained Hidden Markov Models for Robot Navigation: Bridging the Topological-Geometrical Gap
Hidden Markov models hmms and partially observable Markov decision processes pomdps provide useful tools for modeling dynamical systems. They are particularly useful for represent...
Hagit Shatkay, Leslie Pack Kaelbling
EMMCVPR
2011
Springer
14 years 6 months ago
Multiple-Instance Learning with Structured Bag Models
Traditional approaches to Multiple-Instance Learning (MIL) operate under the assumption that the instances of a bag are generated independently, and therefore typically learn an in...
Jonathan Warrell, Philip H. S. Torr
ICASSP
2008
IEEE
16 years 1 months ago
Learning to satisfy
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies...
Frederic Thouin, Mark Coates, Brian Eriksson, Robe...