Sciweavers

3607 search results - page 205 / 722
» Learning with structured sparsity
Sort
View
ML
2008
ACM
174views Machine Learning» more  ML 2008»
15 years 3 months ago
ALLPAD: approximate learning of logic programs with annotated disjunctions
In this paper we present the system ALLPAD for learning Logic Programs with Annotated Disjunctions (LPADs). ALLPAD modifies the previous system LLPAD in order to tackle real world ...
Fabrizio Riguzzi
141
Voted
ITS
2010
Springer
182views Multimedia» more  ITS 2010»
15 years 2 months ago
An Interactive Learning Environment for Problem-Changing Exercise
: To make a new problem from the original one and to compare their solutions are promising activities to promote a learner to be aware of the structure of these problems. Especiall...
Tsukasa Hirashima, Sho Yamamoto, Hiromi Waki
AROBOTS
2002
115views more  AROBOTS 2002»
15 years 3 months ago
Statistical Learning for Humanoid Robots
The complexity of the kinematic and dynamic structure of humanoid robots make conventional analytical approaches to control increasingly unsuitable for such systems. Learning techn...
Sethu Vijayakumar, Aaron D'Souza, Tomohiro Shibata...
ICML
2005
IEEE
16 years 4 months ago
Large margin non-linear embedding
It is common in classification methods to first place data in a vector space and then learn decision boundaries. We propose reversing that process: for fixed decision boundaries, ...
Alexander Zien, Joaquin Quiñonero Candela
ISNN
2007
Springer
15 years 10 months ago
Sparse Coding in Sparse Winner Networks
This paper investigates a mechanism for reliable generation of sparse code in a sparsely connected, hierarchical, learning memory. Activity reduction is accomplished with local com...
Janusz A. Starzyk, Yinyin Liu, David D. Vogel