7868 search results - page 160 / 1574 » Learning by Answer Sets |
117
click to vote
ALT
2010
Springer
15 years 6 months ago
2010
Springer
We explore a general Bayesian active learning setting, in which the learner can ask arbitrary yes/no questions. We derive upper and lower bounds on the expected number of queries r...
167
click to vote
ICMLC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Many supervised and unsupervised learning algorithms depend on the choice of an appropriate distance metric. While metric learning for supervised learning tasks has a lon...
169
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
208
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
Nested Intervals generalize Nested Sets. They are immune to hierarchy reorganization problem. They allow answering ancestor path hierarchical queries algorithmically - without acc...
172
Voted
ISAAC
2007
Springer
15 years 11 months ago
2007
Springer
In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i...