发明名称 NEW HEURISTIC FOR OPTIMIZING NON-CONVEX FUNCTION FOR LEARNING TO RANK
摘要 <p>Techniques for optimizing non-convex function for learning to rank are described. Consistent with some embodiments, a search module may set an order for a group of search features. The group of search features can be used by a ranking model to determine the relevance of items in a search query. Additionally, the search module can assign a first weight factor to a first search feature in the group of search features. Moreover, the search module can calculate a mean reciprocal rank for the search query based on the assigned first weight factor. Furthermore, the search module can determine a second weight factor, using a preset incremental vector, for a second search feature in the group of search features to maximize the mean reciprocal rank for the search query. Subsequently, the search module can assign the second weight factor to the second search feature in the group of search features.</p>
申请公布号 EP2950226(A1) 申请公布日期 2015.12.02
申请号 EP20150159110 申请日期 2015.03.13
申请人 LINKEDIN CORPORATION 发明人 XIAO, FEI;SINHA, SHAKTI DHIRENDRAJI;KANDURI, SATYA PRADEEP;DOMMETI, RAMESH
分类号 G06F17/30 主分类号 G06F17/30
代理机构 代理人
主权项
地址