Eliminating Search Intent Bias in Learning to Rank

被引:4
|
作者
Sun, Yingcheng [1 ]
Kolacinski, Richard [1 ]
Loparo, Kenneth A. [1 ]
机构
[1] Case Western Reserve Univ, Cleveland, OH 44106 USA
来源
2020 IEEE 14TH INTERNATIONAL CONFERENCE ON SEMANTIC COMPUTING (ICSC 2020) | 2020年
关键词
Search Intent; Click Bias; Learning to Rank;
D O I
10.1109/ICSC.2020.00022
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Click-through data has proven to be a valuable resource for improving search-ranking quality. Search engines can easily collect click data, but biases introduced in the data can make it difficult to use the data effectively. In order to measure the effects of biases, many click models have been proposed in the literature. However, none of the models can explain the observation that users with different search intent (e.g., informational, navigational, etc.) have different click behaviors. In this paper, we study how differences in user search intent can influence click activities and determined that there exists a bias between user search intent and the relevance of the document relevance. Based on this observation, we propose a search intent bias hypothesis that can be applied to most existing click models to improve their ability to learn unbiased relevance. Experimental results demonstrate that after adopting the search intent hypothesis, click models can better interpret user clicks and substantially improve retrieval performance.
引用
收藏
页码:108 / 115
页数:8
相关论文
共 50 条
  • [1] Learning to Rank with Selection Bias in Personal Search
    Wang, Xuanhui
    Bendersky, Michael
    Metzler, Donald
    Najork, Marc
    SIGIR'16: PROCEEDINGS OF THE 39TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2016, : 115 - 124
  • [2] The whens and hows of learning to rank for web search
    Craig Macdonald
    Rodrygo L. T. Santos
    Iadh Ounis
    Information Retrieval, 2013, 16 : 584 - 628
  • [3] The whens and hows of learning to rank for web search
    Macdonald, Craig
    Santos, Rodrygo L. T.
    Ounis, Iadh
    INFORMATION RETRIEVAL, 2013, 16 (05): : 584 - 628
  • [4] Pairwise Learning to Rank for Search Query Correction
    Novak, Antonin
    Sedivy, Jan
    2013 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC 2013), 2013, : 3054 - 3059
  • [5] An Empirical Study of Learning to Rank for Entity Search
    Chen, Jing
    Xiong, Chenyan
    Callan, Jamie
    SIGIR'16: PROCEEDINGS OF THE 39TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2016, : 737 - 740
  • [6] Controlling Fairness and Bias in Dynamic Learning-to-Rank
    Morik, Marco
    Singh, Ashudeep
    Hong, Jessica
    Joachims, Thorsten
    PROCEEDINGS OF THE 43RD INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '20), 2020, : 429 - 438
  • [7] Controlling Popularity Bias in Learning-to-Rank Recommendation
    Abdollahpouri, Himan
    Burke, Robin
    Mobasher, Bamshad
    PROCEEDINGS OF THE ELEVENTH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS'17), 2017, : 42 - 46
  • [8] Correcting for Selection Bias in Learning-to-rank Systems
    Ovaisi, Zohreh
    Ahsan, Ragib
    Zhang, Yifan
    Vasilaky, Kathryn
    Zheleva, Elena
    WEB CONFERENCE 2020: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2020), 2020, : 1863 - 1873
  • [9] Matching Cross Network for Learning to Rank in Personal Search
    Qin, Zhen
    Li, Zhongliang
    Bendersky, Michael
    Metzler, Donald
    WEB CONFERENCE 2020: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2020), 2020, : 2835 - 2841
  • [10] Multi-task learning to rank for web search
    Chang, Yi
    Bai, Jing
    Zhou, Ke
    Xue, Gui-Rong
    Zha, Hongyuan
    Zheng, Zhaohui
    PATTERN RECOGNITION LETTERS, 2012, 33 (02) : 173 - 181