49 search results - page 3 / 10 » A boosting algorithm for learning bipartite ranking function... |
AI
2008
Springer
13 years 6 months ago
2008
Springer
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
ICML
1998
IEEE
14 years 7 months ago
1998
IEEE
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
WWW
2008
ACM
14 years 7 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...
KDD
2007
ACM
14 years 6 months ago
2007
ACM
Typical approaches to multi-label classification problem require learning an independent classifier for every label from all the examples and features. This can become a computati...
PAMI
2011
13 years 1 months ago
2011
—Semi-supervised learning concerns the problem of learning in the presence of labeled and unlabeled data. Several boosting algorithms have been extended to semi-supervised learni...