.png){kind=icon}
Return
FSMRank: Feature Selection Algorithm for Learning to Rank
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2013.2247628.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In recent years, there has been growing interest in learning to rank. The introduction of feature selection into different learning problems has been proven effective. These facts motivate us to investigate the problem of feature selection for learning to rank. We propose a joint convex optimization formulation which minimizes ranking errors while simultaneously conducting feature selection. This optimization formulation provides a flexible framework in which we can easily incorporate various importance measures and similarity measures of the features. To solve this optimization problem, we use the Nesterov's approach to derive an accelerated gradient algorithm with a fast convergence rate O(1/T-2). We further develop a generalization bound for the proposed optimization problem using the Rademacher complexities. Extensive experimental evaluations are conducted on the public LETOR benchmark datasets. The results demonstrate that the proposed method shows: 1) significant ranking performance gain compared to several feature selection baselines for ranking, and 2) very competitive performance compared to several state-of-the-art learning-to-rank algorithms.
Keywords:
Accelerated gradient algorithm
feature selection
generalization bound
learning to rank
Journal
IF:
8.9
Papers:
7.6K
Citations:
7.2W
Organization
View more organizations
Cited Papers
ShareSaveShareSave
ShareSaveN-methyl-d-aspartate-induced nitric oxide release: An in vivo microdialysis study.png)
Neuroscience
NeuroscienceIF0
PREAI
ShareSave View more