Towards recency ranking in web search
暂无分享,去创建一个
Gilad Mishne | Fernando Diaz | Jing Bai | Zhaohui Zheng | Yi Chang | Anlei Dong | Ruiqiang Zhang | Karolina Buchner | Ciya Liao | G. Mishne | Anlei Dong | Fernando Diaz | Yi Chang | Zhaohui Zheng | Ciya Liao | Jing Bai | Ruiqiang Zhang | Karolina Buchner
[1] Tie-Yan Liu,et al. Learning to rank: from pairwise approach to listwise approach , 2007, ICML '07.
[2] Hongyuan Zha,et al. A General Boosting Method and its Application to Learning Ranking Functions for Web Search , 2007, NIPS.
[3] Jon M. Kleinberg,et al. Bursty and Hierarchical Structure in Streams , 2002, Data Mining and Knowledge Discovery.
[4] Marius Pasca,et al. Towards temporal web search , 2008, SAC '08.
[5] Gerhard Weikum,et al. Time-Aware Authority Ranking , 2005, Internet Math..
[6] Francesco Romani,et al. Ranking a stream of news , 2005, WWW '05.
[7] Philip S. Yu,et al. Time Sensitive Ranking with Application to Publication Search , 2008, 2008 Eighth IEEE International Conference on Data Mining.
[8] Fernando Diaz,et al. Integration of news content into web results , 2009, WSDM '09.
[9] Jian-Yun Nie,et al. Search Engine Adaptation by Feedback Control Adjustment for Time-sensitive Query , 2009, NAACL.
[10] Sérgio Nunes. Exploring temporal evidence in web information retrieval , 2007 .
[11] ChengXiang Zhai,et al. Learn from web search logs to organize search results , 2007, SIGIR.
[12] Junghoo Cho,et al. Page quality: in search of an unbiased web ranking , 2005, SIGMOD '05.
[13] Thorsten Joachims,et al. Optimizing search engines using clickthrough data , 2002, KDD.
[14] Qiang Wu,et al. Click-through prediction for news queries , 2009, SIGIR.
[15] Irem Arikan,et al. Time Will Tell: Leveraging Temporal Expressions in IR , 2009, WSDM.
[16] Sandeep Pandey,et al. Shuffling a Stacked Deck: The Case for Partially Randomized Ranking of Search Engine Results , 2005, VLDB.
[17] Jaana Kekäläinen,et al. Cumulated gain-based evaluation of IR techniques , 2002, TOIS.
[18] Tie-Yan Liu,et al. Learning to rank for information retrieval , 2009, SIGIR.
[19] Dimitrios Gunopulos,et al. Identifying similarities, periodicities and bursts for online search queries , 2004, SIGMOD '04.
[20] J. Friedman. Greedy function approximation: A gradient boosting machine. , 2001 .
[21] Gregory N. Hullender,et al. Learning to rank using gradient descent , 2005, ICML.
[22] Yoram Singer,et al. An Efficient Boosting Algorithm for Combining Preferences by , 2013 .