440 search results - page 65 / 88 » A Fast Algorithm for Learning a Ranking Function from Large-... |
ALT
2010
Springer
13 years 9 months ago
2010
Springer
: The ability to distinguish, differentiate and contrast between different data sets is a key objective in data mining. Such ability can assist domain experts to understand their d...
SIAMIS
2010
13 years 2 months ago
2010
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...
ILP
2004
Springer
14 years 1 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
ESANN
2006
13 years 9 months ago
2006
In this article, we extend a local prototype-based learning model by active learning, which gives the learner the capability to select training samples during the model adaptation...
ECML
2005
Springer
14 years 1 months ago
2005
Springer
ABSTRACT. Estimating a non-uniformly sampled function from a set of learning points is a classical regression problem. Kernel methods have been widely used in this context, but eve...