首页 | 本学科首页   官方微博 | 高级检索  
     


Learning to Rank
Authors:Andrew?Trotman  author-information"  >  author-information__contact u-icon-before"  >  mailto:andrew@cs.otago.ac.nz"   title="  andrew@cs.otago.ac.nz"   itemprop="  email"   data-track="  click"   data-track-action="  Email author"   data-track-label="  "  >Email author
Affiliation:(1) Department of Computer Science, University of Otago, Dunedin, New Zealand
Abstract:New general purpose ranking functions are discovered using genetic programming. The TREC WSJ collection was chosen as a training set. A baseline comparison function was chosen as the best of inner product, probability, cosine, and Okapi BM25. An elitist genetic algorithm with a population size 100 was run 13 times for 100 generations and the best performing algorithms chosen from these. The best learned functions, when evaluated against the best baseline function (BM25), demonstrate some significant performance differences, with improvements in mean average precision as high as 32% observed on one TREC collection not used in training. In no test is BM25 shown to significantly outperform the best learned function.
Keywords:searching  document ranking  genetic programming  machine learning
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号