238 search results - page 20 / 48 » Learning Recursive Automata from Positive Examples |
AIED
2007
Springer
14 years 1 months ago
2007
Springer
Self-explaining has been repeatedly shown to result in positive learning outcomes for students in a wide variety of disciplines. However, there are two potential accounts for why s...
ILP
2003
Springer
14 years 22 days ago
2003
Springer
In the case of concept learning from positive and negative examples, it is rarely possible to find a unique discriminating conjunctive rule; in most cases, a disjunctive descripti...
ICFCA
2007
Springer
14 years 1 months ago
2007
Springer
Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (...
EMNLP
2010
13 years 5 months ago
2010
Although many algorithms have been developed to harvest lexical resources, few organize the mined terms into taxonomies. We propose (1) a semi-supervised algorithm that uses a roo...
MM
2000
ACM
13 years 12 months ago
2000
ACM
We have designed a graphical interface that enables 3D visual artists or developers of interactive 3D virtual environments to efficiently define sophisticated camera compositions ...