{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:53:49Z","timestamp":1725580429338},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642201608"},{"type":"electronic","value":"9783642201615"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20161-5_39","type":"book-chapter","created":{"date-parts":[[2011,4,12]],"date-time":"2011-04-12T07:41:23Z","timestamp":1302594083000},"page":"387-398","source":"Crossref","is-referenced-by-count":0,"title":["Smoothing Click Counts for Aggregated Vertical Search"],"prefix":"10.1007","author":[{"given":"Jangwon","family":"Seo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. Bruce","family":"Croft","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kwang Hyun","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joon Ho","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","unstructured":"Acton, F.S.: Numerical Methods that Work, 2nd edn. The Mathematical Association of America (1997)"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Agichtein, E., Brill, E., Dumais, S.: Improving web search ranking by incorporating user behavior information. In: SIGIR 2006, pp. 19\u201326 (2006)","DOI":"10.1145\/1148170.1148177"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. In: NIPS, vol.\u00a014, pp. 585\u2013591 (2001)","DOI":"10.7551\/mitpress\/1120.003.0080"},{"key":"39_CR4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.7551\/mitpress\/6173.003.0016","volume-title":"Semi-Supervised Learning","author":"Y. Bengio","year":"2006","unstructured":"Bengio, Y., Delalleau, O., Le Roux, N.: Label propagation and quadratic criterion. In: Chapelle, O., Sch\u00f6lkopf, B., Zien, A. (eds.) Semi-Supervised Learning, pp. 193\u2013216. MIT Press, Cambridge (2006)"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Chapelle, O., Zhang, Y.: A dynamic bayesian network click model for web search ranking. In: WWW 2009, pp. 1\u201310 (2009)","DOI":"10.1145\/1526709.1526711"},{"key":"39_CR6","volume-title":"Spectral Graph Theory","author":"F.R.K. Chung","year":"1997","unstructured":"Chung, F.R.K.: Spectral Graph Theory. American Mathematical Society, Providence (1997)"},{"key":"39_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-0171-6","volume-title":"Language Modeling for Information Retrieval","author":"W.B. Croft","year":"2003","unstructured":"Croft, W.B., Lafferty, J.: Language Modeling for Information Retrieval. Kluwer Academic Publishers, Norwell (2003)"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Diaz, F.: Regularizing ad hoc retrieval scores. In: CIKM 2005, pp. 672\u2013679 (2005)","DOI":"10.1145\/1099554.1099722"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Dupret, G.E., Piwowarski, B.: A user browsing model to predict search engine click data from past observations. In: SIGIR 2008, pp. 331\u2013338 (2008)","DOI":"10.1145\/1390334.1390392"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Gao, J., Yuan, W., Li, X., Deng, K., Nie, J.Y.: Smoothing clickthrough data for web search ranking. In: SIGIR 2009, pp. 355\u2013362 (2009)","DOI":"10.1145\/1571941.1572003"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"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\u2013235 (2006)","DOI":"10.1145\/1148170.1148212"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Optimizing search engines using clickthrough data. In: KDD 2002, pp. 133\u2013142 (2002)","DOI":"10.1145\/775066.775067"},{"key":"39_CR13","unstructured":"Joachims, T.: Transductive learning via spectral graph partitioning. In: ICML 2003, pp. 290\u2013297 (2003)"},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"Joachims, T., Granka, L., Pan, B., Hembrooke, H., Gay, G.: Accurately interpreting clickthrough data as implicit feedback. In: SIGIR 2005, pp. 154\u2013161 (2005)","DOI":"10.1145\/1076034.1076063"},{"key":"39_CR15","first-page":"129","volume":"6","author":"J. Lafferty","year":"2005","unstructured":"Lafferty, J., Lebanon, G.: Diffusion kernels on statistical manifolds. The Journal of Machine Learning Research\u00a06, 129\u2013163 (2005)","journal-title":"The Journal of Machine Learning Research"},{"key":"39_CR16","doi-asserted-by":"crossref","unstructured":"Li, X., Wang, Y.Y., Acero, A.: Learning query intent from regularized click graphs. In: SIGIR 2008, pp. 339\u2013346 (2008)","DOI":"10.1145\/1390334.1390393"},{"issue":"2","key":"39_CR17","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/1480506.1480520","volume":"42","author":"V. Murdock","year":"2008","unstructured":"Murdock, V., Lalmas, M.: Workshop on aggregated search. SIGIR Forum\u00a042(2), 80\u201383 (2008)","journal-title":"SIGIR Forum"},{"key":"39_CR18","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the web. Tech. Rep. 1999-66, Stanford InfoLab (1999)"},{"key":"39_CR19","doi-asserted-by":"crossref","unstructured":"Radlinski, F., Joachims, T.: Active exploration for learning rankings from clickthrough data. In: KDD 2007, pp. 570\u2013579 (2007)","DOI":"10.1145\/1281192.1281254"},{"key":"39_CR20","unstructured":"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)"},{"key":"39_CR21","volume-title":"Advances in Neural Information Processing Systems","author":"M. Szummer","year":"2001","unstructured":"Szummer, M., Jaakkola, T.: Partially labeled classification with markov random walks. In: Dietterich, T., et al. (eds.) Advances in Neural Information Processing Systems, vol.\u00a014. MIT Press, Cambridge (2001)"},{"key":"39_CR22","unstructured":"Van Rijsbergen, C.J.: Information Retrieval, 2nd edn. Dept. of Computer Science, University of Glasgow (1979)"},{"key":"39_CR23","doi-asserted-by":"crossref","unstructured":"Zhai, C., Lafferty, J.: A study of smoothing methods for language models applied to ad hoc information retrieval. In: SIGIR 2001, pp. 334\u2013342 (2001)","DOI":"10.1145\/383952.384019"},{"key":"39_CR24","unstructured":"Zhu, X., Ghahramani, Z.: Learning from labeled and unlabeled data with label propagation. Tech. Rep. CMU-CALD-02-107, Carnegie Mellon University (2002)"}],"container-title":["Lecture Notes in Computer Science","Advances in Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20161-5_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T02:20:38Z","timestamp":1712370038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20161-5_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642201608","9783642201615"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20161-5_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}