.png){kind=icon}
返回
Expert list-wise ranking method based on sparse learning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2016.01.111.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Expert ranking is the core issue of expert retrieval. Taking into consideration the complexity of feature redundancy in traditional dense listwise Learning to Rank method and local optimum in parameter learning, the article proposed the expert listwise Learning to Rank method based on sparse learning. The objective function was defined through the optimization process of experts listwise ranking performance index. Then the Learning to Rank loss function was solved by the objective function. Thus feature dimension reduction was achieved by the feature threshold from the loss-control function of sparse learning algorithm and the steps above. In order to verify whether the feature threshold is optimal, the article made cross validation with the feature threshold and the objective function of model parameter vector to get the optimal model parameters vector and to verify the feature threshold. Meanwhile the article realized expert ranking via the expert listwise ranking model based on sparse learning, which depends on feature dimension reduction and parameter tuning. At last, the contrast experiments of expert ranking proved the effectiveness of the proposed method, which supported expert listwise ranking strongly. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Learning to Rank
Sparse learning
Feature dimension reduction
Expert listwise ranking
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Research on Transparency Design Based on Shared Situation Awareness in Semi-Automatic Driving基于共享情境感知的半自动驾驶透明度设计研究
OAAI
OAAI分享收藏
N-methyl-d-aspartate-induced nitric oxide release: An in vivo microdialysis study.png)
Neuroscience
NeuroscienceIF0
PREAI
分享收藏分享收藏分享收藏
查看更多内容