2100 search results - page 86 / 420 » Learning to rank on graphs |
126
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
178
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
182
click to vote
CIKM
2009
Springer
16 years 23 days ago
2009
Springer
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
129
click to vote
ICALT
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper describes a study that investigates the use of a multimodal technology in a learning task. In relation to the recent interest in learning as a multimodal experience, th...
171
click to vote
TNN
2010
15 years 27 days ago
2010
In recent years, learning from imbalanced data has attracted growing attention from both academia and industry due to the explosive growth of applications that use and produce imba...