Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2872427.2883033acmotherconferencesArticle/Chapter ViewAbstractPublication PagesthewebconfConference Proceedingsconference-collections
research-article

A Neural Click Model for Web Search

Published: 11 April 2016 Publication History

Abstract

Understanding user browsing behavior in web search is key to improving web search effectiveness. Many click models have been proposed to explain or predict user clicks on search engine results. They are based on the probabilistic graphical model (PGM) framework, in which user behavior is represented as a sequence of observable and hidden events. The PGM framework provides a mathematically solid way to reason about a set of events given some information about other events. But the structure of the dependencies between the events has to be set manually. Different click models use different hand-crafted sets of dependencies. We propose an alternative based on the idea of distributed representations: to represent the user's information need and the information available to the user with a vector state. The components of the vector state are learned to represent concepts that are useful for modeling user behavior. And user behavior is modeled as a sequence of vector states associated with a query session: the vector state is initialized with a query, and then iteratively updated based on information about interactions with the search engine results. This approach allows us to directly understand user browsing behavior from click-through data, i.e., without the need for a predefined set of rules as is customary for PGM-based click models. We illustrate our approach using a set of neural click models. Our experimental results show that the neural click model that uses the same training data as traditional PGM-based click models, has better performance on the click prediction task (i.e., predicting user click on search engine results) and the relevance prediction task (i.e., ranking documents by their relevance to a query). An analysis of the best performing neural click model shows that it learns similar concepts to those used in traditional click models, and that it also learns other concepts that cannot be designed manually.

References

[1]
Y. Bengio. Learning deep architectures for AI. Foundations and trends in Machine Learning, 2 (1): 1--127, 2009.
[2]
Y. Bengio, P. Simard, and P. Frasconi. Learning long-term dependencies with gradient descent is difficult. IEEE Transactions on Neural Networks, 5 (2): 157--166, 1994.
[3]
J. Bergstra, O. Breuleux, F. Bastien, P. Lamblin, R. Pascanu, G. Desjardins, J. Turian, D. Warde-Farley, and Y. Bengio. Theano: a CPU and GPU math expression compiler. In SciPy, 2010.
[4]
O. Chapelle and Y. Zhang. A dynamic bayesian network click model for web search ranking. In WWW, pages 1--10. ACM, 2009.
[5]
O. Chapelle, D. Metlzer, Y. Zhang, and P. Grinspan. Expected reciprocal rank for graded relevance. In CIKM, pages 621--630. ACM, 2009.
[6]
Chen, Chen, Wang, Chen, and Yang}chen2012beyondD. Chen, W. Chen, H. Wang, Z. Chen, and Q. Yang. Beyond ten blue links: enabling user click modeling in federated web search. In WSDM, pages 463--472. ACM, 2012\natexlaba.
[7]
Chen, Wang, Zhang, Chen, Singla, and Yang}chen2012noiseW. Chen, D. Wang, Y. Zhang, Z. Chen, A. Singla, and Q. Yang. A noise-aware click model for web search. In WSDM, pages 313--322. ACM, 2012\natexlabb.
[8]
Chuklin, Serdyukov, and de Rijke}chuklin2013clickA. Chuklin, P. Serdyukov, and M. de Rijke. Click model-based information retrieval metrics. In SIGIR, pages 493--502. ACM, 2013.
[9]
Chuklin, Serdyukov, and de Rijke}chuklin2013usingA. Chuklin, P. Serdyukov, and M. de Rijke. Using intent information to model user behavior in diversified search. In Advances in Information Retrieval, pages 1--13. Springer, 2013.
[10]
A. Chuklin, I. Markov, and M. de Rijke. Click Models for Web Search. Morgan & Claypool, 2015.
[11]
N. Craswell, O. Zoeter, M. Taylor, and B. Ramsey. An experimental comparison of click position-bias models. In WSDM, pages 87--94. ACM, 2008.
[12]
G. Dupret and C. Liao. A model to estimate intrinsic document relevance from the clickthrough logs of a web search engine. In WSDM, pages 181--190. ACM, 2010.
[13]
G. E. Dupret and B. Piwowarski. A user browsing model to predict search engine click data from past observations. In SIGIR, pages 331--338. ACM, 2008.
[14]
J. L. Elman. Rethinking innateness: A connectionist perspective on development, volume 10. MIT press, 1998.
[15]
A. Graves and J. Schmidhuber. Framewise phoneme classification with bidirectional lstm and other neural network architectures. IEEE Transactions on Neural Networks, 18 (5): 602--610, 2005.
[16]
A. Graves, A.-r. Mohamed, and G. Hinton. Speech recognition with deep recurrent neural networks. In ICASSP, pages 6645--6649. IEEE, 2013.
[17]
A. Grotov, A. Chuklin, I. Markov, L. Stout, F. Xumara, and M. de Rijke. A comparative study of click models for web search. In CLEF, 2015.
[18]
Guo, Liu, Kannan, Minka, Taylor, Wang, and Faloutsos}guo2009clickF. Guo, C. Liu, A. Kannan, T. Minka, M. Taylor, Y.-M. Wang, and C. Faloutsos. Click chain model in web search. In WWW, pages 11--20. ACM, 2009.
[19]
Guo, Liu, and Wang}guo2009efficientF. Guo, C. Liu, and Y. M. Wang. Efficient multiple-click models in web search. In WSDM, pages 124--131. ACM, 2009.
[20]
S. Hochreiter and J. Schmidhuber. Long short-term memory. Neural computation, 9 (8): 1735--1780, 1997.
[21]
elin and Kekalainen(2000)}jarvelin2000irK. Jarvelin and J. Kekalainen. IR evaluation methods for retrieving highly relevant documents. In SIGIR, pages 41--48. ACM, 2000.
[22]
R. Jozefowicz, W. Zaremba, and I. Sutskever. An empirical exploration of recurrent network architectures. In ICML, pages 2342--2350, 2015.
[23]
D. Koller and N. Friedman. Probabilistic graphical models: principles and techniques. MIT press, 2009.
[24]
A. Krizhevsky, I. Sutskever, and G. E. Hinton. Imagenet classification with deep convolutional neural networks. In NIPS, pages 1097--1105, 2012.
[25]
Y. Liu, C. Wang, K. Zhou, J. Nie, M. Zhang, and S. Ma. From skimming to reading: A two-stage examination model for web search. In CIKM, pages 849--858. ACM, 2014.
[26]
T. Mikolov, M. Karafiát, L. Burget, J. Cernockỳ, and S. Khudanpur. Recurrent neural network based language model. In INTERSPEECH, pages 1045--1048, 2010.
[27]
T. Mikolov, I. Sutskever, K. Chen, G. S. Corrado, and J. Dean. Distributed representations of words and phrases and their compositionality. In NIPS, pages 3111--3119, 2013.
[28]
R. Pascanu, T. Mikolov, and Y. Bengio. On the difficulty of training recurrent neural networks. arXiv preprint arXiv:1211.5063, 2012.
[29]
D. E. Rumelhart, J. L. McClelland, P. R. Group, et al. Parallel distributed processing, volume 1. IEEE, 1988.
[30]
S. Shen, B. Hu, W. Chen, and Q. Yang. Personalized click model through collaborative filtering. In WSDM, pages 323--332. ACM, 2012.
[31]
I. Sutskever, O. Vinyals, and Q. V. Le. Sequence to sequence learning with neural networks. In NIPS, pages 3104--3112, 2014.
[32]
L. Van der Maaten and G. Hinton. Visualizing data using t-SNE. JMLR, 9 (2579--2605): 85, 2008.
[33]
C. Wang, Y. Liu, M. Zhang, S. Ma, M. Zheng, J. Qian, and K. Zhang. Incorporating vertical results into search click models. In SIGIR, pages 503--512. ACM, 2013.
[34]
H. Wang, C. Zhai, A. Dong, and Y. Chang. Content-aware click modeling. In WWW, pages 1365--1376, 2013.
[35]
E. Yilmaz, M. Shokouhi, N. Craswell, and S. Robertson. Expected browsing utility for web search evaluation. In CIKM, pages 1561--1564. ACM, 2010.
[36]
M. D. Zeiler. ADADELTA: An adaptive learning rate method. arXiv preprint arXiv:1212.5701, 2012.
[37]
Y. Zhang, W. Chen, D. Wang, and Q. Yang. User-click modeling for understanding and predicting search-behavior. In KDD, pages 1388--1396. ACM, 2011.

Cited By

View all
  • (2024)A bias study and an unbiased deep neural network for recommender systemsWeb Intelligence10.3233/WEB-23003622:1(15-29)Online publication date: 26-Mar-2024
  • (2024)A topic relevance-aware click model for web searchJournal of Intelligent & Fuzzy Systems10.3233/JIFS-23689446:4(8961-8974)Online publication date: 18-Apr-2024
  • (2024)Counteracting Duration Bias in Video Recommendation via Counterfactual Watch TimeProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671817(4455-4466)Online publication date: 25-Aug-2024
  • Show More Cited By

Index Terms

  1. A Neural Click Model for Web Search

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    WWW '16: Proceedings of the 25th International Conference on World Wide Web
    April 2016
    1482 pages
    ISBN:9781450341431

    Sponsors

    • IW3C2: International World Wide Web Conference Committee

    In-Cooperation

    Publisher

    International World Wide Web Conferences Steering Committee

    Republic and Canton of Geneva, Switzerland

    Publication History

    Published: 11 April 2016

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. click modeling
    2. deep learning
    3. distributed representations
    4. recurrent neural networks
    5. user behavior
    6. web search

    Qualifiers

    • Research-article

    Funding Sources

    • Netherlands Organisation for Scientific Research (NWO)
    • Swiss National Science Foundation
    • Amsterdam Data Science
    • Netherlands Institute for Sound and Vision
    • Netherlands eScience Center
    • Dutch national program COMMIT

    Conference

    WWW '16
    Sponsor:
    • IW3C2
    WWW '16: 25th International World Wide Web Conference
    April 11 - 15, 2016
    Québec, Montréal, Canada

    Acceptance Rates

    WWW '16 Paper Acceptance Rate 115 of 727 submissions, 16%;
    Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)49
    • Downloads (Last 6 weeks)5
    Reflects downloads up to 15 Oct 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)A bias study and an unbiased deep neural network for recommender systemsWeb Intelligence10.3233/WEB-23003622:1(15-29)Online publication date: 26-Mar-2024
    • (2024)A topic relevance-aware click model for web searchJournal of Intelligent & Fuzzy Systems10.3233/JIFS-23689446:4(8961-8974)Online publication date: 18-Apr-2024
    • (2024)Counteracting Duration Bias in Video Recommendation via Counterfactual Watch TimeProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671817(4455-4466)Online publication date: 25-Aug-2024
    • (2024)On (Normalised) Discounted Cumulative Gain as an Off-Policy Evaluation Metric for Top-n RecommendationProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671687(1222-1233)Online publication date: 25-Aug-2024
    • (2024)USimAgent: Large Language Models for Simulating Search UsersProceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3626772.3657963(2687-2692)Online publication date: 10-Jul-2024
    • (2024)Neural Click Models for Recommender SystemsProceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3626772.3657939(2553-2558)Online publication date: 10-Jul-2024
    • (2024)Unbiased Learning to Rank Meets Reality: Lessons from Baidu's Large-Scale Search DatasetProceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3626772.3657892(1546-1556)Online publication date: 10-Jul-2024
    • (2024)Counterfactual Ranking Evaluation with Flexible Click ModelsProceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3626772.3657810(1200-1210)Online publication date: 10-Jul-2024
    • (2024)Probabilistic graph model and neural network perspective of click models for web searchKnowledge and Information Systems10.1007/s10115-024-02145-z66:10(5829-5873)Online publication date: 6-Jun-2024
    • (2024)MassiveClicks: A Massively-Parallel Framework for Efficient Click Models TrainingEuro-Par 2023: Parallel Processing Workshops10.1007/978-3-031-50684-0_18(232-245)Online publication date: 16-Apr-2024
    • Show More Cited By

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media