-
1
-
-
77950931233
-
Time will tell: Leveraging temporal expressions in ir
-
I. Arikan, S. Bedathur, and K. Berberich. Time will tell: Leveraging temporal expressions in ir. WSDM, 2009.
-
(2009)
WSDM
-
-
Arikan, I.1
Bedathur, S.2
Berberich, K.3
-
2
-
-
77950954707
-
Web dynamics, age and page qualit
-
R. Baeza-Yates, F. Saint-Jean, and C. Castillo. Web dynamics, age and page qualit. String Processing and Information Retrieval, pages 453-461, 2002.
-
(2002)
String Processing and Information Retrieval
, pp. 453-461
-
-
Baeza-Yates, R.1
Saint-Jean, F.2
Castillo, C.3
-
3
-
-
84924198627
-
Time-aware authority rankings
-
K. Berberich, M. Vazirgiannis, and G. Weikum. Time-aware authority rankings. Internet Math, 2(3):301-332, 2005.
-
(2005)
Internet Math
, vol.2
, Issue.3
, pp. 301-332
-
-
Berberich, K.1
Vazirgiannis, M.2
Weikum, G.3
-
4
-
-
31844446958
-
Learning to rank using gradient descent
-
C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, and G. Hullender. Learning to rank using gradient descent. Proc. of Intl. Conf. on Machine Learning, 2005.
-
Proc. of Intl. Conf. on Machine Learning, 2005
-
-
Burges, C.1
Shaked, T.2
Renshaw, E.3
Lazier, A.4
Deeds, M.5
Hamilton, N.6
Hullender, G.7
-
5
-
-
34547987951
-
Learning to rank: From pairwise approach to listwise
-
Z. Cao, T. Qin, T. Liu, M. Tsai, and H. Li. Learning to rank: From pairwise approach to listwise. Proceedings of ICML conference, 2007.
-
Proceedings of ICML Conference, 2007
-
-
Cao, Z.1
Qin, T.2
Liu, T.3
Tsai, M.4
Li, H.5
-
10
-
-
0035470889
-
Greedy function approximation: A gradient boosting machine
-
J. Friedman. Greedy function approximation: a gradient boosting machine. Ann. Statist., 29:1189-1232, 2001.
-
(2001)
Ann. Statist.
, vol.29
, pp. 1189-1232
-
-
Friedman, J.1
-
13
-
-
0242540464
-
Bursty and hierarchical structure in streams
-
J. Kleinberg. Bursty and hierarchical structure in streams. In KDD, pages 91-101, 2002.
-
(2002)
KDD
, pp. 91-101
-
-
Kleinberg, J.1
-
14
-
-
72449201596
-
Click-through prediction for news queries
-
A. C. König, M. Gamon, and Q. Wu. Click-through prediction for news queries. Proc. of SIGIR, pages 347-354, 2009.
-
(2009)
Proc. of SIGIR
, pp. 347-354
-
-
König, A.C.1
Gamon, M.2
Wu, Q.3
-
18
-
-
33745620504
-
Shuffling a stacked deck: The case for partially randomized ranking of search engine results
-
S. Pandey, S. Roy, C. Olston, J. Cho, and S. Chakrabarti. Shuffling a stacked deck: The case for partially randomized ranking of search engine results. VLDB, 2005.
-
(2005)
VLDB
-
-
Pandey, S.1
Roy, S.2
Olston, C.3
Cho, J.4
Chakrabarti, S.5
-
19
-
-
77950961537
-
Towards temporal web search
-
M. Pasca. Towards temporal web search. ACM SAC, 2008.
-
(2008)
ACM SAC
-
-
Pasca, M.1
-
20
-
-
3142717571
-
Identifying similarities, periodicities and bursts for online search queries
-
M. Vlachos, C. Meek, Z. Vagena, and D. Gunopulos. Identifying similarities, periodicities and bursts for online search queries. In SIGMOD, pages 131-142, 2004.
-
(2004)
SIGMOD
, pp. 131-142
-
-
Vlachos, M.1
Meek, C.2
Vagena, Z.3
Gunopulos, D.4
-
22
-
-
78249241698
-
Search result re-ranking by feedback control adjustment for time-sensitive query
-
R. Zhang, Y. Chang, Z. Zheng, D. Metzler, and J. Nie. Search result re-ranking by feedback control adjustment for time-sensitive query. North American Chapter of the Association for Computational Linguistics - Human Language Technologies (NAACL HLT), 2009.
-
(2009)
North American Chapter of the Association for Computational Linguistics - Human Language Technologies (NAACL HLT)
-
-
Zhang, R.1
Chang, Y.2
Zheng, Z.3
Metzler, D.4
Nie, J.5
-
23
-
-
84865328708
-
A general boosting method and its application to learning ranking functions for web search
-
Z. Zheng, H. Zhang, T. Zhang, O. Chapelle, K. Chen, and G. Sun. A general boosting method and its application to learning ranking functions for web search. NIPS, 2007.
-
(2007)
NIPS
-
-
Zheng, Z.1
Zhang, H.2
Zhang, T.3
Chapelle, O.4
Chen, K.5
Sun, G.6
|