To read this content please select one of the options below:

Click models inspired learning to rank

Amir Hosein Keyhanipour (Computer Engineering Department, Faculty of Engineering, College of Farabi, Tehran University, Tehran, Iran)
Farhad Oroumchian (Faculty of Engineering and Information Sciences, University of Wollongong in Dubai, Dubai Knowledge Park, Dubai, UAE)

International Journal of Web Information Systems

ISSN: 1744-0084

Article publication date: 7 June 2021

Issue publication date: 6 September 2021

88

Abstract

Purpose

Incorporating users’ behavior patterns could help in the ranking process. Different click models (CMs) are introduced to model the sophisticated search-time behavior of users among which commonly used the triple of attractiveness, examination and satisfaction. Inspired by this fact and considering the psychological definitions of these concepts, this paper aims to propose a novel learning to rank by redefining these concepts. The attractiveness and examination factors could be calculated using a limited subset of information retrieval (IR) features by the random forest algorithm, and then they are combined with each other to predicate the satisfaction factor which is considered as the relevance level.

Design/methodology/approach

The attractiveness and examination factors of a given document are usually considered as its perceived relevance and the fast scan of its snippet, respectively. Here, attractiveness and examination factors are regarded as the click-count and the investigation rate, respectively. Also, the satisfaction of a document is supposed to be the same as its relevance level for a given query. This idea is supported by the strong correlation between attractiveness-satisfaction and the examination-satisfaction. Applying random forest algorithm, the attractiveness and examination factors are calculated using a very limited set of the primitive features of query-document pairs. Then, by using the ordered weighted averaging operator, these factors are aggregated to estimate the satisfaction.

Findings

Experimental results on MSLR-WEB10K and WCL2R data sets show the superiority of this algorithm over the state-of-the-art ranking algorithms in terms of P@n and NDCG criteria. The enhancement is more noticeable in top-ranked items which are reviewed more by the users.

Originality/value

This paper proposes a novel learning to rank based on the redefinition of major building blocks of the CMs which are the attractiveness, examination and satisfactory. It proposes a method to use a very limited number of selected IR features to estimate the attractiveness and examination factors and then combines these factors to predicate the satisfactory which is regarded as the relevance level of a document with respect to a given query.

Keywords

Acknowledgements

Authors would like to give special thanks to Ms. Maryam Piroozmand, PhD student of the University of Tehran in Algorithms and Computation, for her support and help.

Citation

Keyhanipour, A.H. and Oroumchian, F. (2021), "Click models inspired learning to rank", International Journal of Web Information Systems, Vol. 17 No. 4, pp. 261-286. https://doi.org/10.1108/IJWIS-03-2021-0017

Publisher

:

Emerald Publishing Limited

Copyright © 2021, Emerald Publishing Limited

Related articles