Abstract
The problem of ranking has recently gained attention in data learning. The goal ranking is to learn a real-valued ranking function that induces a ranking or ordering over an instance space. In this paper, we apply popular Bayesian techniques on ranking support vector machine. We propose a novel differentiable loss function called trigonometric loss function with the desirable characteristic of natural normalization in the likelihood function, and then follow standard Gaussian processes techniques to set up a Bayesian framework. In this framework, Bayesian inference is used to implement model adaptation, while keeping the merits of ranking SVM. Experimental results on data sets indicate the useful-ness of this approach.
| Original language | English |
|---|---|
| Pages (from-to) | 290-298 |
| Number of pages | 9 |
| Journal | Advances in Information Sciences and Service Sciences |
| Volume | 3 |
| Issue number | 8 |
| DOIs | |
| State | Published - Sep 2011 |
Keywords
- Machine learning
- Ranking
- SVM
- Trigonometric loss function
Fingerprint
Dive into the research topics of 'Learning to rank with Bayesian evidence framework'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver