skip to main content
10.1145/2124295.2124336acmconferencesArticle/Chapter ViewAbstractPublication PageswsdmConference Proceedingsconference-collections
research-article

Personalized click model through collaborative filtering

Authors Info & Claims
Published:08 February 2012Publication History

ABSTRACT

Click modeling aims to interpret the users' search click data in order to predict their clicking behavior. Existing models can well characterize the position bias of documents and snippets in relation to users' mainstream click behavior. Yet, current advances depict users' search actions only in a general setting by implicitly assuming that all users act in the same way, regardless of the fact that anyone, motivated with some individual interest, is more likely to click on a link than others. It is in light of this that we put forward a novel personalized click model to describe the user-oriented click preferences, which applies and extends matrix / tensor factorization from the view of collaborative filtering to connect users, queries and documents together. Our model serves as a generalized personalization framework that can be incorporated to the previously proposed click models and, in many cases, to their future extensions. Despite the sparsity of search click data, our personalized model demonstrates its advantage over the best click models previously discussed in the Web-search literature, supported by our large-scale experiments on a real dataset. A delightful bonus is the model's ability to gain insights into queries and documents through latent feature vectors, and hence to handle rare and even new query-document pairs much better than previous click models.

References

  1. D. Agarwal, R. Agrawal, R. Khanna, and N. Kota. Estimating rates of rare events with multiple hierarchies through scalable log-linear models. In KDD, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. E. Agichtein, E. Brill, and S. Dumais. Improving web search ranking by incorporating user behavior information. In SIGIR, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. O. Chapelle and Y. Zhang. A dynamic bayesian network click model for web search ranking. In WWW, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. W. Chen, Z. Ji, S. Shen, and Q. Yang. A whole page click model to better interpret search engine click data. In AAAI, 2011.Google ScholarGoogle Scholar
  5. N. Craswell, O. Zoeter, M. Taylor, and B. Ramsey. An experimental comparison of click position-bias models. In WSDM, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society, Series B, 39(1), 1977.Google ScholarGoogle Scholar
  7. G. Dupret and C. Liao. A model to estimate intrinsic document relevance from the clickthrough logs of a web search engine. In WSDM, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. G. E. Dupret and B. Piwowarski. A user browsing model to predict search engine click data from past observations. In SIGIR, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. L. A. Granka, T. Joachims, and G. Gay. Eye-tracking analysis of user behavior in www search. In SIGIR, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. F. Guo, C. Liu, A. Kannan, T. Minka, M. Taylor, Y.-M. Wang, and C. Faloutsos. Click chain model in web search. In WWW, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. F. Guo, C. Liu, and Y. M. Wang. Efficient multiple-click models in web search. In WSDM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. B. Hu, Y. Zhang, W. Chen, G. Wang, and Q. Yang. Characterizing search intent diversity into click models. In WWW, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. T. Joachims. Optimizing search engines using clickthrough data. In KDD, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. T. Joachims, L. Granka, B. Pan, H. Hembrooke, and G. Gay. Accurately interpreting clickthrough data as implicit feedback. In SIGIR, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. D. Kempe and M. Mahdian. A cascade model for externalities in sponsored search. Springer-Verlag.Google ScholarGoogle Scholar
  16. Y. Koren, R. Bell, and C. Volinsky. Matrix factorization techniques for recommender systems. Computer, August 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. C. Liu, F. Guo, and C. Faloutsos. Bbm: bayesian browsing model from petabyte-scale data. In KDD, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. S. Rendle and S.-T. Lars. Pairwise interaction tensor factorization for personalized tag recommendation. In WSDM, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. M. Richardson, E. Dominowska, and R. Ragno. Predicting clicks: estimating the click-through rate for new ads. In WWW, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. R. Salakhutdinov and A. Mnih. Probabilistic matrix factorization. In NIPS, 2008.Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. W. Xu, E. Manavoglu, and E. Cantu-Paz. Temporal click model for sponsored search. In SIGIR, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Y. Zhang, W. Chen, D. Wang, and Q. Yang. User-click modeling for understanding and predicting search-behavior. In KDD, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Y. Zhang, D. Wang, G. Wang, W. Chen, Z. Zhang, B. Hu, and L. Zhang. Learning click models via probit bayesian inference. In CIKM, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Z. A. Zhu, W. Chen, T. Minka, C. Zhu, and Z. Chen. A novel click model and its applications to online advertising. In WSDM, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Personalized click model through collaborative filtering

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      WSDM '12: Proceedings of the fifth ACM international conference on Web search and data mining
      February 2012
      792 pages
      ISBN:9781450307475
      DOI:10.1145/2124295

      Copyright © 2012 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 8 February 2012

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate498of2,863submissions,17%

      Upcoming Conference

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader