.png){kind=icon}
.png){kind=icon}
Return
Learning performance of coefficient-based regularized ranking
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2013.11.032.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The regularized kernel methods for ranking problem have attracted increasing attention recently, which are usually based on the regularization scheme in a reproducing kernel Hilbert space. In this paper, we go beyond this framework by investigating the generalization ability of ranking with coefficient-based regularization. A regularized ranking algorithm with a data-dependent hypothesis space is proposed and its representer theorem is proved. The generalization error bound is established in terms of the covering numbers of the hypothesis space. Different from the previous analysis relying on Mercer kernels, our theoretical analysis is based on much general kernel function, which is not necessarily symmetric or positive semi-definite. Empirical results on the benchmark datasets demonstrate the effectiveness of the coefficient-based algorithm. (C) 2014 Elsevier B.V. All rights reserved.
Keywords:
Ranking
Coefficient regularization
Generalization bound
Recommendation system
Drug discovery
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W