Abstract
A ranking model utilizing the multiple hyperplanes optimized by the order relations is proposed based on RankSVM in this paper. Firstly, the multiple hyperplanes are built based on the order relations between the ranks for training data in this model. Then, the ranking list generated by multiple hyperplanes is aggregated to gain the final ranking results. The proposed model is tested on LETOR OHSUMED dataset, some typical indices in Information Retrieval field being applied to evaluate its performance and the method being compared with other methods such as RankSVM. The experimental results show that the model not only has better ranking performance but also shorten the training time evidently.
| Original language | English |
|---|---|
| Pages (from-to) | 327-334 |
| Number of pages | 8 |
| Journal | Moshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence |
| Volume | 23 |
| Issue number | 3 |
| State | Published - Jun 2010 |
Keywords
- Learning to rank
- Multiple hyperplanes
- Order relations
- Ranking aggregation
- Support vector machine (SVM)