Ranking items by optimizing ranking cost function

摘要

A dependency structure is used to divide samples corresponding to items to be ranked into leaf nodes, based on the rank of the items. The dependency structure is trained by splitting or merging training data received at given nodes based on selected features and selected thresholds for those features. A metric is then calculated which is indicative of performance of the node, in splitting the data. The trained structure is then used during runtime to rank items.