Sciweavers

1393 search results - page 3 / 279
» Machine Learning by Function Decomposition
Sort
View
AI
1999
Springer
13 years 8 months ago
Learning by Discovering Concept Hierarchies
We present a new machine learning method that, given a set of training examples, induces a definition of the target concept in terms of a hierarchy of intermediate concepts and th...
Blaz Zupan, Marko Bohanec, Janez Demsar, Ivan Brat...
ICML
2004
IEEE
14 years 9 months ago
Support vector machine learning for interdependent and structured output spaces
Learning general functional dependencies is one of the main goals in machine learning. Recent progress in kernel-based methods has focused on designing flexible and powerful input...
Ioannis Tsochantaridis, Thomas Hofmann, Thorsten J...
EH
1999
IEEE
351views Hardware» more  EH 1999»
14 years 25 days ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...
ICPR
2000
IEEE
14 years 9 months ago
General Bias/Variance Decomposition with Target Independent Variance of Error Functions Derived from the Exponential Family of D
An important theoretical tool in machine learning is the bias/variance decomposition of the generalization error. It was introduced for the mean square error in [3]. The bias/vari...
Jakob Vogdrup Hansen, Tom Heskes
EWLR
1997
Springer
14 years 21 days ago
Learning Complex Robot Behaviours by Evolutionary Computing with Task Decomposition
Building robots can be a tough job because the designer has to predict the interactions between the robot and the environment as well as to deal with them. One solution to cope the...
Wei-Po Lee, John Hallam, Henrik Hautop Lund