3607 search results - page 282 / 722 » Learning with structured sparsity |
181
click to vote
JMLR
2010
15 years 1 months ago
2010
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
198
click to vote
AAAI
2011
14 years 6 months ago
2011
We present a method for dependency grammar induction that utilizes sparse annotations of semantic relations. This induction set-up is attractive because such annotations provide u...
169
click to vote
CIARP
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. It is argued that the ability to generalise is the most important characteristic of learning and that generalisation may be achieved only if pattern recognition systems l...
159
click to vote
ILP
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we focus on the problem of learning reactive skills for use by physical agents. We propose a new representation for such procedures, teleoreactive logic programs, al...
154
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
The organizational algorithm is examined as a computational approach to representing interpersonal learning. The structure of the algorithm is introduced and described in context ...