发明名称 Query-Dependent Ranking Using K-Nearest Neighbor
摘要 Described is a technology in which documents associated with a query are ranked by a ranking model that depends on the query. When a query is processed, a ranking model for the query is selected/determined based upon nearest neighbors to the query in query feature space. In one aspect, the ranking model is trained online, based on a training set obtained from a number of nearest neighbors to the query. In an alternative aspect, ranking models are trained offline using training sets; the query is used to find a most similar training set based on nearest neighbors of the query, with the ranking model that corresponds to the most similar training set being selected for ranking. In another alternative aspect, the ranking models are trained offline, with the nearest neighbor to the query determined and used to select its associated ranking model.
申请公布号 US2010169323(A1) 申请公布日期 2010.07.01
申请号 US20080344607 申请日期 2008.12.29
申请人 MICROSOFT CORPORATION 发明人 LIU TIE-YAN;GENG XIUBO;LI HANG
分类号 G06F17/30;G06F7/00 主分类号 G06F17/30
代理机构 代理人
主权项
地址