Sciweavers

495 search results - page 34 / 99
» Learning to generalize for complex selection tasks
Sort
View
ICCV
2009
IEEE
15 years 1 months ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...
ICML
1999
IEEE
14 years 23 days ago
Learning Hierarchical Performance Knowledge by Observation
Developing automated agents that intelligently perform complex real world tasks is time consuming and expensive. The most expensive part of developing these intelligent task perfo...
Michael van Lent, John E. Laird
ECML
2006
Springer
14 years 4 days ago
Margin-Based Active Learning for Structured Output Spaces
In many complex machine learning applications there is a need to learn multiple interdependent output variables, where knowledge of these interdependencies can be exploited to impr...
Dan Roth, Kevin Small
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
14 years 1 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor
WOA
2001
13 years 9 months ago
Implementing Adaptive Capabilities on Agents that Act in a Dynamic Environment
Acting in a dynamic environment is a complex task that requires several issues to be investigated, with the aim of controlling the associated search complexity. In this paper, a l...
Giuliano Armano, Giancarlo Cherchi, Eloisa Vargiu