Article

Smoothing Click Counts for Aggregated Vertical Search

Authors:

W. Bruce Croft,

Kwang Hyun Kim,

Joon Ho LeeAuthors Info & Claims

ECIR 2011: Proceedings of the 33rd European Conference on Advances in Information Retrieval - Volume 6611

Pages 387 - 398

https://doi.org/10.1007/978-3-642-20161-5_39

Published: 18 April 2011 Publication History

Abstract

Clickthrough data is a critical feature for improving web search ranking. Recently, many search portals have provided aggregated search, which retrieves relevant information from various heterogeneous collections called verticals. In addition to the well-known problem of rank bias, clickthrough data recorded in the aggregated search environment suffers from severe sparseness problems due to the limited number of results presented for each vertical. This skew in clickthrough data, which we call rank cut, makes optimization of vertical searches more difficult. In this work, we focus on mitigating the negative effect of rank cut for aggregated vertical searches. We introduce a technique for smoothing click counts based on spectral graph analysis. Using real clickthrough data from a vertical recorded in an aggregated search environment, we show empirically that clickthrough data smoothed by this technique is effective for improving the vertical search.

References

[1]

Acton, F.S.: Numerical Methods that Work, 2nd edn. The Mathematical Association of America 1997

[2]

Agichtein, E., Brill, E., Dumais, S.: Improving web search ranking by incorporating user behavior information. In: SIGIR 2006, pp. 19---26 2006

Digital Library

[3]

Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. In: NIPS, vol. 14, pp. 585---591 2001

Digital Library

[4]

Bengio, Y., Delalleau, O., Le Roux, N.: Label propagation and quadratic criterion. In: Chapelle, O., Schölkopf, B., Zien, A. eds. Semi-Supervised Learning, pp. 193---216. MIT Press, Cambridge 2006

[5]

Chapelle, O., Zhang, Y.: A dynamic bayesian network click model for web search ranking. In: WWW 2009, pp. 1---10 2009

Digital Library

[6]

Chung, F.R.K.: Spectral Graph Theory. American Mathematical Society, Providence 1997

[7]

Croft, W.B., Lafferty, J.: Language Modeling for Information Retrieval. Kluwer Academic Publishers, Norwell 2003

Digital Library

[8]

Diaz, F.: Regularizing ad hoc retrieval scores. In: CIKM 2005, pp. 672---679 2005

Digital Library

[9]

Dupret, G.E., Piwowarski, B.: A user browsing model to predict search engine click data from past observations. In: SIGIR 2008, pp. 331---338 2008

Digital Library

[10]

Gao, J., Yuan, W., Li, X., Deng, K., Nie, J.Y.: Smoothing clickthrough data for web search ranking. In: SIGIR 2009, pp. 355---362 2009

Digital Library

[11]

Jeon, J., Croft, W.B., Lee, J.H., Park, S.: A framework to predict the quality of answers with non-textual features. In: SIGIR 2006, pp. 228---235 2006

Digital Library

[12]

Joachims, T.: Optimizing search engines using clickthrough data. In: KDD 2002, pp. 133---142 2002

Digital Library

[13]

Joachims, T.: Transductive learning via spectral graph partitioning. In: ICML 2003, pp. 290---297 2003

Digital Library

[14]

Joachims, T., Granka, L., Pan, B., Hembrooke, H., Gay, G.: Accurately interpreting clickthrough data as implicit feedback. In: SIGIR 2005, pp. 154---161 2005

Digital Library

[15]

Lafferty, J., Lebanon, G.: Diffusion kernels on statistical manifolds. The Journal of Machine Learning Research 6, 129---163 2005

Digital Library

[16]

Li, X., Wang, Y.Y., Acero, A.: Learning query intent from regularized click graphs. In: SIGIR 2008, pp. 339---346 2008

Digital Library

[17]

Murdock, V., Lalmas, M.: Workshop on aggregated search. SIGIR Forum 422, 80---83 2008

Digital Library

[18]

Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the web. Tech. Rep. 1999-66, Stanford InfoLab 1999

[19]

Radlinski, F., Joachims, T.: Active exploration for learning rankings from clickthrough data. In: KDD 2007, pp. 570---579 2007

Digital Library

[20]

Strohman, T., Metzler, D., Turtle, H., Croft, W.B.: Indri: A language model-based search engine for complex queries. In: Proceedings of the International Conference on Intelligence Analysis 2005

[21]

Szummer, M., Jaakkola, T.: Partially labeled classification with markov random walks. In: Dietterich, T., et al. eds. Advances in Neural Information Processing Systems, vol. 14. MIT Press, Cambridge 2001

Digital Library

[22]

Van Rijsbergen, C.J.: Information Retrieval, 2nd edn. Dept. of Computer Science, University of Glasgow 1979

Digital Library

[23]

Zhai, C., Lafferty, J.: A study of smoothing methods for language models applied to ad hoc information retrieval. In: SIGIR 2001, pp. 334---342 2001

Digital Library

[24]

Zhu, X., Ghahramani, Z.: Learning from labeled and unlabeled data with label propagation. Tech. Rep. CMU-CALD-02-107, Carnegie Mellon University 2002

Cited By

Chuklin ASchuth AZhou KRijke M(2015)A Comparative Analysis of Interleaving Methods for Aggregated SearchACM Transactions on Information Systems10.1145/266812033:2(1-38)Online publication date: 17-Feb-2015
https://dl.acm.org/doi/10.1145/2668120
Chuklin ASerdyukov Pde Rijke MHe QIyengar ANejdl WPei JRastogi R(2013)Modeling clicks beyond the first result pageProceedings of the 22nd ACM international conference on Information & Knowledge Management10.1145/2505515.2507859(1217-1220)Online publication date: 27-Oct-2013
https://dl.acm.org/doi/10.1145/2505515.2507859
Chuklin ASchuth AHofmann KSerdyukov Pde Rijke MHe QIyengar ANejdl WPei JRastogi R(2013)Evaluating aggregated search using interleavingProceedings of the 22nd ACM international conference on Information & Knowledge Management10.1145/2505515.2505698(669-678)Online publication date: 27-Oct-2013
https://dl.acm.org/doi/10.1145/2505515.2505698
Show More Cited By

Recommendations

Smoothing click counts for aggregated vertical search
ECIR'11: Proceedings of the 33rd European conference on Advances in information retrieval

Clickthrough data is a critical feature for improving web search ranking. Recently, many search portals have provided aggregated search, which retrieves relevant information from various heterogeneous collections called verticals. In addition to the ...
Incorporating vertical results into search click models
SIGIR '13: Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval

In modern search engines, an increasing number of search result pages (SERPs) are federated from multiple specialized search engines (called verticals, such as Image or Video). As an effective approach to interpret users' click-through behavior as ...
Characterizing search intent diversity into click models
WWW '11: Proceedings of the 20th international conference on World wide web

Modeling a user's click-through behavior in click logs is a challenging task due to the well-known position bias problem. Recent advances in click models have adopted the examination hypothesis which distinguishes document relevance from position bias. ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

ECIR 2011: Proceedings of the 33rd European Conference on Advances in Information Retrieval - Volume 6611

April 2011

792 pages

ISBN:9783642201608

Editors:
Paul Clough
Information School, University of Sheffield, Sheffield, UK
,
Colum Foley
CLARITY: Centre for Sensor Web Technologies, School of Computing, Dublin City University, Dublin 9, Ireland
,
Cathal Gurrin
CLARITY: Centre for Sensor Web Technologies, School of Computing, Dublin City University, Dublin 9, Ireland
,
Gareth Jones
Centre for Next Generation Localisation, School of Computing, Dublin City University, Dublin 9, Ireland
,
Wessel Kraaij
TNO Human Factors, Delft, The Netherlands
,
Hyowon Lee
CLARITY: Centre for Sensor Web Technologies, School of Computing, Dublin City University, Dublin 9, Ireland
,
Vanessa Mudoch
Yahoo! Research, Barcelona, Spain

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 18 April 2011

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 17 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chuklin ASchuth AZhou KRijke M(2015)A Comparative Analysis of Interleaving Methods for Aggregated SearchACM Transactions on Information Systems10.1145/266812033:2(1-38)Online publication date: 17-Feb-2015
https://dl.acm.org/doi/10.1145/2668120
Chuklin ASerdyukov Pde Rijke MHe QIyengar ANejdl WPei JRastogi R(2013)Modeling clicks beyond the first result pageProceedings of the 22nd ACM international conference on Information & Knowledge Management10.1145/2505515.2507859(1217-1220)Online publication date: 27-Oct-2013
https://dl.acm.org/doi/10.1145/2505515.2507859
Chuklin ASchuth AHofmann KSerdyukov Pde Rijke MHe QIyengar ANejdl WPei JRastogi R(2013)Evaluating aggregated search using interleavingProceedings of the 22nd ACM international conference on Information & Knowledge Management10.1145/2505515.2505698(669-678)Online publication date: 27-Oct-2013
https://dl.acm.org/doi/10.1145/2505515.2505698
Yi XAllan J(2011)Discovering missing click-through query language information for web searchProceedings of the 20th ACM international conference on Information and knowledge management10.1145/2063576.2063604(153-162)Online publication date: 24-Oct-2011
https://dl.acm.org/doi/10.1145/2063576.2063604

View Options

View options

Media

Figures

Other

Tables

View Table of Contents