876 search results - page 89 / 176 » A theory of learning with similarity functions |
118
click to vote
ACL
1994
15 years 3 months ago
1994
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
124
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
An agent population can be evolved in a complex environment to perform various tasks and optimize its job performance using Learning Classifier System (LCS) technology. Due to the...
101
click to vote
WWW
2008
ACM
16 years 2 months ago
2008
ACM
We consider the problem of ranking refinement, i.e., to improve the accuracy of an existing ranking function with a small set of labeled instances. We are, particularly, intereste...
113
click to vote
UAI
2003
15 years 3 months ago
2003
Continuous time Bayesian networks (CTBN) describe structured stochastic processes with finitely many states that evolve over continuous time. A CTBN is a directed (possibly cycli...
115
Voted
COLT
1999
Springer
15 years 6 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...