Learning to aggregate vertical results into web search results

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2011, Pages 201-210

  Arguello, Jaime ^a   Diaz, Fernando ^b   Callan, Jamie ^c  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b Yahoo Research New York   (United States)

^c Carnegie Mellon University   (United States)

Author keywords

aggregated search; federated search; learning to rank; query intent

Indexed keywords

AGGREGATED SEARCH; FEATURE REPRESENTATION; FEDERATED SEARCH; GENERAL APPROACH; LEARNING MODELS; LEARNING TO RANK; QUERY INTENT; SEARCH SERVICES; SEARCH TASKS; WEB SEARCHES;

INFORMATION RETRIEVAL; KNOWLEDGE MANAGEMENT; LEARNING ALGORITHMS;

WORLD WIDE WEB;

EID: 83055192000     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2063576.2063611     Document Type: Conference Paper

References (17)

1. J. Arguello, F. Diaz, J. Callan, and B. Carterette. A methodology for evaluating aggregated search results. In ECIR 2011, pages 141-152. Springer Berlin / Heidelberg, 2011.
2. J. Arguello, F. Diaz, J. Callan, and J.-F. Crespo. Sources of evidence for vertical selection. In SIGIR 2009, pages 315-322. ACM, 2009.
3. J. Arguello, F. Diaz, and J.-F. Paiement. Vertical selection in the presence of unlabeled verticals. In SIGIR 2010, pages 691-698. ACM, 2010.
4. D. M. Bikel, R. Schwartz, and R. M. Weischedel. An algorithm that learns what is in a name. Machine Learning, 34:211-231, 1999.
5. L. Breiman, J. Friedman, C. J. Stone, and R. A. Olshen. Classification and Regression Trees. Chapman and Hall/CRC, 1984.
6. F. Diaz. Integration of news content into web results. In WSDM 2009, pages 182-191. ACM, 2009.
7. F. Diaz and J. Arguello. Adaptation of offine vertical selection predictions in the presence of user feedback. In SIGIR 2009, pages 323-330. ACM, 2009.
8. H. Jeffreys. An invariant form for the prior probability in estimation problems. Proceedings of the Royal Society of London. Series A, Mathematical and Physical Sciences, 186(1007):453-461, 1946.
9. T. Joachims. Optimizing search engines using clickthrough data. In KDD 2002, pages 133-142. ACM, 2002.
10. A. C. König, M. Gamon, and Q. Wu. Click-through prediction for news queries. In SIGIR 2009, pages 347-354. ACM, 2009.
11. R. Kumar and S. Vassilvitskii. Generalized distances between rankings. In WWW 2010, pages 571-580. ACM, 2010.
12. X. Li, Y.-Y. Wang, and A. Acero. Learning query intent from regularized click graphs. In SIGIR 2008, pages 339-346. ACM, 2008.
13. C.-J. Lin, R. C. Weng, and S. S. Keerthi. Trust region newton methods for large-scale logistic regression. In ICML 2007, pages 561-568. ACM, 2007.
14. T.-Y. Liu. Learning to rank for information retrieval. Foundations and Trends in Informaton Retrieval, 3:225-331, 2009.
15. C. D. Manning, P. Raghavan, and H. Schtze. Introduction to Information Retrieval. Cambridge University Press, New York, NY, USA, 2008.
16. A. K. Ponnuswami, K. Pattabiraman, Q. Wu, R. Gilad-Bachrach, and T. Kanungo. On composition of a federated web search result page: Using online users to provide pairwise preference for heterogeneous verticals. In WSDM 2011, pages 715-724. ACM, 2011.
17. M. Schulze. A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method. Social Choice and Welfare, 36:267-303, 2011.