Pith. sign in

REVIEW 1 cited by

A Survey on E-Commerce Learning to Rank

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2412.03581 v1 pith:TFZQXFPO submitted 2024-11-19 cs.IR cs.AIcs.LG

classification cs.IRcs.AIcs.LG
keywords e-commercerankingalgorithmsranksearchlearningplatformsresult
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In e-commerce, ranking the search results based on users' preference is the most important task. Commercial e-commerce platforms, such as, Amazon, Alibaba, eBay, Walmart, etc. perform extensive and relentless research to perfect their search result ranking algorithms because the quality of ranking drives a user's decision to purchase or not to purchase an item, directly affecting the profitability of the e-commerce platform. In such a commercial platforms, for optimizing search result ranking numerous features are considered, which emerge from relevance, personalization, seller's reputation and paid promotion. To maintain their competitive advantage in the market, the platforms do no publish their core ranking algorithms, so it is difficult to know which of the algorithms or which of the features is the most effective for finding the most optimal search result ranking in e-commerce. No extensive surveys of ranking to rank in the e-commerce domain is also not yet published. In this work, we survey the existing e-commerce learning to rank algorithms. Besides, we also compare these algorithms based on query relevance criterion on a large real-life e-commerce dataset and provide a quantitative analysis. To the best of our knowledge this is the first such survey which include an experimental comparison among various learning to rank algorithms.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning to Rank Tensor Network Contraction Plans for GPU-Accelerated Quantum Circuit Simulation

    cs.LG 2026-08 conditional novelty 6.0 of 10

    Learning-to-rank models trained on measured GPU runtimes can rank tensor-network contraction plans well enough to make Top-3 selection practical, but performance drops under circuit-family shift and is partly backend-...

Pith tools