Computer and Modernization ›› 2017, Vol. 0 ›› Issue (3): 54-.doi: 10.3969/j.issn.1006-2475.2017.03.012

Previous Articles     Next Articles

Search Rank Model Based on Random Forests and LambdaMART

  

  1. 1. Wuhan Research Institute of Posts and Telecommunications, Wuhan 430074, China;
    2. Nanjing R & D, FiberHome Telecommunication Technologies Co., Ltd., Nanjing 210019, China
  • Received:2016-08-03 Online:2017-03-29 Published:2017-03-30

Abstract:

Recent studies have shown that Boosting provides excellent predictive performance across a wide variety of tasks. In learningtorank, boosted models such as
RankBoost and LambdaMART have been shown to be among the best performing learning methods based on evaluations on public data sets. In this paper, we investigate Random Forests
(RF) and LambdaMART. Then we combine the two algorithms by first learning a ranking function with RF and using it as initialization for LambdaMART to create a new rank model.
We report our results on the public learningtorank data sets using two metrics ERR and NDCG. The new rank model performs better than two original algorithms models.

Key words:  , learning to rank; Random Forests; LambdaMART; ensemble learning; ranking model

CLC Number: