Sciweavers

2090 search results - page 79 / 418
» Learning with attribute costs
Sort
View
ICONIP
2007
13 years 10 months ago
Practical Recurrent Learning (PRL) in the Discrete Time Domain
One of the authors has proposed a simple learning algorithm for recurrent neural networks, which requires computational cost and memory capacity in practical order O(n2 )[1]. The a...
Mohamad Faizal Bin Samsudin, Takeshi Hirose, Katsu...
ICIP
2003
IEEE
14 years 10 months ago
Annotating retrieval database with active learning
In this paper, we describe a retrieval system that uses hidden annotation to improve the performance. The contribution of this paper is a novel active learning framework that can ...
Cha Zhang, Tsuhan Chen
JMLR
2002
89views more  JMLR 2002»
13 years 8 months ago
The Set Covering Machine
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
Mario Marchand, John Shawe-Taylor
FOIKS
2008
Springer
14 years 6 months ago
Cost-minimising strategies for data labelling : optimal stopping and active learning
Supervised learning deals with the inference of a distribution over an output or label space $\CY$ conditioned on points in an observation space $\CX$, given a training dataset $D$...
Christos Dimitrakakis, Christian Savu-Krohn
ROBIO
2006
IEEE
129views Robotics» more  ROBIO 2006»
14 years 3 months ago
Learning Utility Surfaces for Movement Selection
— Humanoid robots are highly redundant systems with respect to the tasks they are asked to perform. This redundancy manifests itself in the number of degrees of freedom of the ro...
Matthew Howard, Michael Gienger, Christian Goerick...