Generalization performance of magnitude-preserving semi-supervised ranking with graph-based regularization
- Publication Type:
- Journal Article
- Citation:
- Information Sciences, 2013, 221 pp. 284 - 296
- Issue Date:
- 2013-02-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
 | 2012004050OK.pdf | 300.07 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
Semi-supervised ranking is a relatively new and important learning problem inspired by many applications. We propose a novel graph-based regularized algorithm which learns the ranking function in the semi-supervised learning framework. It can exploit geometry of the data while preserving the magnitude of the preferences. The least squares ranking loss is adopted and the optimal solution of our model has an explicit form. We establish error analysis of our proposed algorithm and demonstrate the relationship between predictive performance and intrinsic properties of the graph. The experiments on three datasets for recommendation task and two quantitative structure-activity relationship datasets show that our method is effective and comparable to some other state-of-the-art algorithms for ranking. © 2012 Elsevier Inc. All rights reserved.
Please use this identifier to cite or link to this item: