paper.bbl
\begin{thebibliography}{}

\bibitem[Bartell \& Cottrell, 1995][Bartell and Cottrell][1995]{Bartell95}
Bartell, B., \& Cottrell, G.~W. (1995).
\newblock Learning to retrieve information.
\newblock {\em Proceedings of the Swedish Conference on Connectionism}.

\bibitem[Cohen et~al.\/, 1999][Cohen et~al.\/][1999]{Cohen99}
Cohen, W.~W., Shapire, R.~E., \& Singer, Y. (1999).
\newblock Learning to order things.
\newblock {\em Journal of Artificial Intelligence Research}, {\em 10},
  243--270.

\bibitem[Crammer \& Singer, 2001][Crammer and Singer][2001]{Crammer01}
Crammer, K., \& Singer, Y. (2001).
\newblock Pranking with ranking.
\newblock {\em Proceedings of the conference on Neural Information Processing
  Systems (NIPS)}.

\bibitem[Freund et~al.\/, 1998][Freund et~al.\/][1998]{Freund98}
Freund, Y., Iyer, R., Schapire, R.~E., \& Singer, Y. (1998).
\newblock An efficient boosting algorithm for combining preferences.
\newblock {\em International Conference on Machine Learning (ICML)}.

\bibitem[Granka, 2004][Granka][2004]{Granka04}
Granka, L. (2004).
\newblock Eye tracking analysis of user behaviors in online search.
\newblock Master's thesis, Cornell University.

\bibitem[Granka et~al.\/, 2004][Granka et~al.\/][2004]{Granka04b}
Granka, L., Joachims, T., \& Gay, G. (2004).
\newblock Eye-tracking analysis of user behavior in www search.
\newblock {\em Poster Abstract, Proceedings of the Conference on Research and
  Development in Information Retrieval (SIGIR)}.

\bibitem[Herbrich et~al.\/, 2000][Herbrich et~al.\/][2000]{Herbrich00}
Herbrich, R., Graepel, T., \& Obermayer, K. (2000).
\newblock Large margin rank boundaries for ordinal regression.
\newblock {\em Advances in Large Margin Classifiers} (pp.\/ 115--132).

\bibitem[Joachims, 1999][Joachims][1999]{SVMlight}
Joachims, T. (1999).
\newblock Making large-scale {SVM} learning practical.
\newblock In B.~Sch�lkopf, C.~Burges and A.~Smola (Eds.), {\em Advances in
  kernel methods -- support vector machines}. MIT Press.

\bibitem[Joachims, 2002][Joachims][2002]{Joachims02}
Joachims, T. (2002).
\newblock Optimizing search engines using clickthrough data.
\newblock {\em Proceedings of the ACM Conference on Knowledge Discovery and
  Data Mining (KDD)}.

\bibitem[Joachims et~al.\/, 2005][Joachims et~al.\/][2005]{Joachims05}
Joachims, T., Granka, L., Pang, B., Hembrooke, H., \& Gay, G. (2005).
\newblock Accurately interpreting clickthrough data as implicit feedback.
\newblock {\em Annual ACM Conference on Research and Development in Information
  Retrieval (SIGIR)}.

\bibitem[Kelly \& Teevan, 2003][Kelly and Teevan][2003]{Kelly03}
Kelly, D., \& Teevan, J. (2003).
\newblock Implicit feedback for inferring user preference: A bibliography.
\newblock {\em SIGIR Forum}, {\em 32}.

\bibitem[Kemp \& Ramamohanarao, 2003][Kemp and Ramamohanarao][2003]{Kemp02}
Kemp, C., \& Ramamohanarao, K. (2003).
\newblock Long-term learning for web search engines.
\newblock {\em PKDD} (pp.\/ 263--274).

\bibitem[Lau \& Horvitz, 1999][Lau and Horvitz][1999]{Lau99}
Lau, T., \& Horvitz, E. (1999).
\newblock Patterns of search: Analyzing and modelling web query refinement.
\newblock {\em Proceedings of the 7th International Conference on User
  Modeling}.

\bibitem[Radlinski \& Joachims, 2005][Radlinski and
  Joachims][2005]{Radlinski05}
Radlinski, F., \& Joachims, T. (2005).
\newblock Query chains: Learning to rank from implicit feedback.
\newblock {\em Proceedings of the ACM Conference on Knowledge Discovery and
  Data Mining (KDD)}.

\bibitem[Rajaram et~al.\/, 2003][Rajaram et~al.\/][2003]{Rajaram03}
Rajaram, S., Garg, A., Zhou, Z.~S., \& Huang, T.~S. (2003).
\newblock Classification approach towards ranking and sorting problems.
\newblock {\em Lecture Notes in Artificial Intelligence} (pp.\/ 301--312).

\bibitem[Silverstein et~al.\/, 1998][Silverstein et~al.\/][1998]{Silverstein98}
Silverstein, C., Henzinger, M., Marais, H., \& Moricz, M. (1998).
\newblock {\em Analysis of a very large {AltaVista} query log} (Technical
  Report 1998-014).
\newblock Digital SRC.

\end{thebibliography}
