Sciweavers

495 search results - page 22 / 99
» Learning to generalize for complex selection tasks
Sort
View
ICPR
2000
IEEE
13 years 11 months ago
Feature Learning for Recognition with Bayesian Networks
Many realistic visual recognition tasks are “open” in the sense that the number and nature of the categories to be learned are not initially known, and there is no closed set ...
Justus H. Piater, Roderic A. Grupen
FLAIRS
2009
13 years 4 months ago
Beating the Defense: Using Plan Recognition to Inform Learning Agents
In this paper, we investigate the hypothesis that plan recognition can significantly improve the performance of a casebased reinforcement learner in an adversarial action selectio...
Matthew Molineaux, David W. Aha, Gita Sukthankar
MLMI
2004
Springer
14 years 3 days ago
Towards Predicting Optimal Fusion Candidates: A Case Study on Biometric Authentication Tasks
Combining multiple information sources, typically from several data streams is a very promising approach, both in experiments and to some extend in various real-life applications. ...
Norman Poh, Samy Bengio
ICONIP
2007
13 years 8 months ago
Using Generalization Error Bounds to Train the Set Covering Machine
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
Zakria Hussain, John Shawe-Taylor
ICFP
2006
ACM
14 years 6 months ago
Towards an automatic complexity analysis for generic programs
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
Kyle D. Ross