Bi-Rank: A New Bi-Directional Ranking Method for Goods Selection
Yuan Wang, Yang Xiao, Jiefan Qiu
Abstract
Yuan Wang, Yang Xiao, Jiefan Qiu
Abstract
Goods selection is a typical daily routine faced by e-commerce platforms, such as choosing the right goods for on-shelf and off-shelf . In this paper, we turned goods selection problem into a learning-to-rank task (LTR). Instead of ranking the head part and the tail part separately, we proposed a Bi-directional Ranking model, abbreviated as Bi-Rank, to solve this task. Bi-Rank relies on a customized loss function/metric named NDCG PLUS, which is an improved version of NDCG. NDCG PLUS incorporates the ranking loss of tail part in the total ranking loss. In addition, Bi-Rank model can choose different size and weight to balance head and tail. It can also downgrade from double-end to single-end by turn off a designed switch, avoiding the trivial process of manually changing items' label. The experiment shows that Bi-Rank model can achieve a good enough ranking result on collections' head part, while output a similar ranking result on tail part compared to the model that specifically optimizing the tail. In addition, this Bi-Rank model is also very flexible, efficient, and easy to use.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Goods selection is a typical daily routine faced by e-commerce platforms, such as choosing the right goods for on-shelf and off-shelf . In this paper, we turned goods selection problem into a learning-to-rank task (LTR). Instead of ranking the head part and the tail part separately, we proposed a Bi-directional Ranking model, abbreviated as Bi-Rank, to solve this task. Bi-Rank relies on a customized loss function/metric named NDCG PLUS, which is an improved version of NDCG. NDCG PLUS incorporates the ranking loss of tail part in the total ranking loss. In addition, Bi-Rank model can choose different size and weight to balance head and tail. It can also downgrade from double-end to single-end by turn off a designed switch, avoiding the trivial process of manually changing items' label. The experiment shows that Bi-Rank model can achieve a good enough ranking result on collections' head part, while output a similar ranking result on tail part compared to the model that specifically optimizing the tail. In addition, this Bi-Rank model is also very flexible, efficient, and easy to use.
Key concepts: Learning to rank, Ranking (information retrieval), Ranking SVM, Rank (graph theory), Computer science, Selection (genetic algorithm), Task (project management), Metric (unit)