4930 search results - page 182 / 986 » Learning minimal abstractions |
182
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
184
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
We consider graph drawing algorithms for learning spaces, a type of st-oriented partial cube derived from an antimatroid and used to model states of knowledge of students. We show...
174
click to vote
AAAI
2008
15 years 8 months ago
2008
Transfer learning addresses the problem of how to utilize plenty of labeled data in a source domain to solve related but different problems in a target domain, even when the train...
162
click to vote
UAI
1996
15 years 7 months ago
1996
In learning belief networks, the single link lookahead search is widely adopted to reduce the search space. We show that there exists a class of probabilistic domain models which ...
189
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...