On Including the user dynamic in learning to rank

Nicola Ferro, Claudio Lucchese, Maria Maistro, Raffaele Perego

5 Citationer (Scopus)

Abstract

Ranking query results effectively by considering user past behaviour and preferences is a primary concern for IR researchers both in academia and industry. In this context, LtR is widely believed to be the most effective solution to design ranking models that account for user-interaction features that have proved to remarkably impact on IR effectiveness. In this paper, we explore the possibility of integrating the user dynamic directly into the LtR algorithms. Specifically, we model with Markov chains the behaviour of users in scanning a ranked result list and we modify LambdaMart, a state-of-The-Art LtR algorithm, to exploit a new discount loss function calibrated on the proposed Markovian model of user dynamic. We evaluate the performance of the proposed approach on publicly available LtR datasets, finding that the improvements measured over the standard algorithm are statistically significant.

OriginalsprogEngelsk
TitelSIGIR 2017 - Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval
Antal sider4
ForlagAssociation for Computing Machinery, Inc.
Publikationsdato7 aug. 2017
Sider1041-1044
ISBN (Elektronisk)9781450350228
DOI
StatusUdgivet - 7 aug. 2017
Udgivet eksterntJa
Begivenhed40th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2017 - Tokyo, Shinjuku, Japan
Varighed: 7 aug. 201711 aug. 2017

Konference

Konference40th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2017
Land/OmrådeJapan
ByTokyo, Shinjuku
Periode07/08/201711/08/2017
SponsorAssociation for Computing Machinery Special Interest Group on Information Retrieval (ACM SIGIR)

Fingeraftryk

Dyk ned i forskningsemnerne om 'On Including the user dynamic in learning to rank'. Sammen danner de et unikt fingeraftryk.

Citationsformater