Sciweavers

43 search results - page 6 / 9
» Learning Stochastic Finite Automata from Experts
Sort
View
ALT
2003
Springer
13 years 11 months ago
Can Learning in the Limit Be Done Efficiently?
Abstract. Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to pot...
Thomas Zeugmann
TCS
2008
13 years 7 months ago
Kernel methods for learning languages
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
KESAMSTA
2009
Springer
14 years 2 months ago
Relational Learning by Imitation
Abstract. Imitative learning can be considered an essential task of humans development. People use instructions and demonstrations provided by other human experts to acquire knowle...
Grazia Bombini, Nicola Di Mauro, Teresa Maria Alto...
JIIS
2008
89views more  JIIS 2008»
13 years 7 months ago
A note on phase transitions and computational pitfalls of learning from sequences
An ever greater range of applications call for learning from sequences. Grammar induction is one prominent tool for sequence learning, it is therefore important to know its proper...
Antoine Cornuéjols, Michèle Sebag
ITICSE
2004
ACM
14 years 27 days ago
Generation as method for explorative learning in computer science education
The use of generic and generative methods for the development and application of interactive educational software is a relatively unexplored area in industry and education. Advant...
Andreas Kerren