Click models inspired learning to rank

被引:3
|
作者
Keyhanipour, Amir Hosein [1 ]
Oroumchian, Farhad [2 ]
机构
[1] Univ Tehran, Comp Engn Dept, Fac Engn, Coll Farabi, Tehran, Iran
[2] Univ Wollongong, Fac Engn & Informat Sci, Dubai Knowledge Pk, Dubai, U Arab Emirates
关键词
Advanced web applications; Web mining; Web search and information extraction; Learning to rank; Click models; Random forest; Information fusion; PHYSICAL ATTRACTIVENESS;
D O I
10.1108/IJWIS-03-2021-0017
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:261 / 286
页数:26
相关论文
共 50 条
  • [1] Online Learning to Rank in Stochastic Click Models
    Zoghi, Masrour
    Tunys, Tomas
    Ghavamzade, Mohammad
    Kveton, Branislav
    Szepesvari, Csaba
    Wen, Zheng
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 70, 2017, 70
  • [2] Learning to rank with click-through features in a reinforcement learning framework
    Keyhanipour, Amir Hosein
    Moshiri, Behzad
    Piroozmand, Maryam
    Oroumchian, Farhad
    Moeini, Ali
    [J]. INTERNATIONAL JOURNAL OF WEB INFORMATION SYSTEMS, 2016, 12 (04) : 448 - 476
  • [3] CF-Rank: Learning to rank by classifier fusion on click-through data
    Keyhanipour, Amir Hosein
    Moshiri, Behzad
    Rahgozar, Maseud
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (22) : 8597 - 8608
  • [4] Understanding User Behavior in Carousel Recommendation Systems for Click Modeling and Learning to Rank
    de Leon-Martinez, Santiago
    [J]. PROCEEDINGS OF THE 17TH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, WSDM 2024, 2024, : 1139 - 1141
  • [5] Bridging the Gap between Click and Relevance for Learning-to-Rank with Minimal Supervision
    Lee, Jae-woong
    Song, Young-In
    Haam, Deokmin
    Lee, Sanghoon
    Choi, Woo-sik
    Lee, Jongwuk
    [J]. CIKM '20: PROCEEDINGS OF THE 29TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, 2020, : 2109 - 2112
  • [6] 1-click learning of object models for recognition
    Loos, HS
    von der Malsburg, C
    [J]. BIOLOGICALLY MOTIVATED COMPUTER VISION, PROCEEDINGS, 2002, 2525 : 377 - 386
  • [7] Learning Mixtures of Low-Rank Models
    Chen, Yanxi
    Ma, Cong
    Poor, H. Vincent
    Chen, Yuxin
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (07) : 4613 - 4636
  • [8] Learning Efficient Sparse and Low Rank Models
    Sprechmann, P.
    Bronstein, A. M.
    Sapiro, G.
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2015, 37 (09) : 1821 - 1833
  • [9] Active learning inspired method in generative models
    Lan, Guipeng
    Xiao, Shuai
    Yang, Jiachen
    Wen, Jiabao
    Lu, Wen
    Gao, Xinbo
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2024, 249
  • [10] Doubly Robust Estimation for Correcting Position Bias in Click Feedback for Unbiased Learning to Rank
    Oosterhuis, Harrie
    [J]. ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2023, 41 (03)