Generalization performance of magnitude-preserving semi-supervised ranking with graph-based regularization

  • Authors:

  • Zhibin Pan;Xinge You;Hong Chen;Dacheng Tao;Baochuan Pang

  • Affiliations:

  • Department of Electronics and Information Engineering, Huazhong University of Science and Technology, Wuhan 430074, China and College of Science, Huazhong Agricultural University, Wuhan 430070, Ch ...;Department of Electronics and Information Engineering, Huazhong University of Science and Technology, Wuhan 430074, China;College of Science, Huazhong Agricultural University, Wuhan 430070, China;Centre for Quantum Computation and Intelligent Systems, Faculty of Engineering and Information Technology, University of Technology, Sydney Broadway, NSW 2007, Australia;Department of Electronics and Information Engineering, Huazhong University of Science and Technology, Wuhan 430074, China

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2013

Quantified Score

Hi-index 0.07

Visualization

Abstract

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.