Stephen Robertson
Stephen Robertson has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Emine Yilmaz
Microsoft Research
2 shared publications - Arjen P. de Vries
Radboud University, Nijmegen, Netherlands
1 shared publication - Avi Arampatzis
Democritus University of Thrace
1 shared publication - David Bodoff
University of Haifa, Haifa, Israel
1 shared publication - Dawei Song
Beijing Institute of Technology, Beijing, China
1 shared publication - Djoerd Hiemstra
Radboud University, Nijmegen, Netherlands
1 shared publication
Latest Publications
- 27 August 2010
- Published by Springer Nature in Information Retrieval Journal
- Vol. 14 (1) , 1-4
Introduction to special issue on the second international conference on the theory of information retrieval
- 27 August 2010
- Published by Springer Nature in Information Retrieval Journal
- Vol. 14 (1) , 1-4
Introduction to special issue on the second international conference on the theory of information retrieval
- 26 August 2010
- Published by Springer Nature in Information Retrieval Journal
- Vol. 14 (1) , 26-46
Modeling score distributions in information retrieval
- 26 August 2010
- Published by Springer Nature in Information Retrieval Journal
- Vol. 14 (1) , 26-46
Modeling score distributions in information retrieval
- Open Access
- 16 September 2009
- Published by Springer Nature in Information Retrieval Journal
- Vol. 13 (3) , 271-290
On the choice of effectiveness measures for learning to rank
- 16 September 2009
- Published by Springer Nature in Information Retrieval Journal
- Vol. 13 (3) , 271-290
Open AccessOn the choice of effectiveness measures for learning to rank
- 6 June 2008
- Published by Springer Nature in Information Retrieval Journal
- Vol. 11 (6) , 477-497
Probabilistic relevance ranking for collaborative filtering
- 6 June 2008
- Published by Springer Nature in Information Retrieval Journal
- Vol. 11 (6) , 477-497
Probabilistic relevance ranking for collaborative filtering
- 18 January 2008
- Published by Wiley in Journal of the American Society for Information Science and Technology
- Vol. 59 (5) , 852-854
Karen Spärck Jones
- 18 January 2008
- Published by Wiley in Journal of the American Society for Information Science and Technology
- Vol. 59 (5) , 852-854
Karen Spärck Jones
- 30 November 2007
- Published by Elsevier in Information Processing & Management
- Vol. 43 (6) , 1441-1444
In Memoriam: Karen Spärck Jones
- 30 November 2007
- Published by Elsevier in Information Processing & Management
- Vol. 43 (6) , 1441-1444
In Memoriam: Karen Spärck Jones
- 20 April 2007
- Published by Springer Nature in Information Retrieval Journal
- Vol. 10 (3) , 321-339
On rank-based effectiveness measures and optimization
- 20 April 2007
- Published by Springer Nature in Information Retrieval Journal
- Vol. 10 (3) , 321-339
On rank-based effectiveness measures and optimization
- Open Access
- 1 April 2005
- Published by Springer Nature in Information Retrieval Journal
- Vol. 8 (2) , 319-329
On Event Spaces and Probabilistic Models in Information Retrieval
- 1 April 2005
- Published by Springer Nature in Information Retrieval Journal
- Vol. 8 (2) , 319-329
Open AccessOn Event Spaces and Probabilistic Models in Information Retrieval
- 21 January 2004
- Published by Wiley in Journal of the American Society for Information Science and Technology
- Vol. 55 (6) , 471-487
A new unified probabilistic model
This paper proposes a new unified probabilistic model. Two previous models, Robertson et al.'s “Model 0” and “Model 3”, each have strengths and weaknesses. The strength of Model 0 not found in Model 3, is that it does not require relevance data about the particular document or query, and, related to that, its probability estimates are straightforward. The strength of Model 3 not found in Model 0 is that it can utilize feedback information about the particular document and query in question. In this paper we introduce a new unified probabilistic model that combines these strengths: the expression of its probabilities is straightforward, it does not require that data must be available for the particular document or query in question, but it can utilize such specific data if it is available. The model is one way to resolve the difficulty of combining two marginal views in probabilistic retrieval.
- 21 January 2004
- Published by Wiley in Journal of the American Society for Information Science and Technology
- Vol. 55 (6) , 471-487
A new unified probabilistic model
This paper proposes a new unified probabilistic model. Two previous models, Robertson et al.'s “Model 0” and “Model 3”, each have strengths and weaknesses. The strength of Model 0 not found in Model 3, is that it does not require relevance data about the particular document or query, and, related to that, its probability estimates are straightforward. The strength of Model 3 not found in Model 0 is that it can utilize feedback information about the particular document and query in question. In this paper we introduce a new unified probabilistic model that combines these strengths: the expression of its probabilities is straightforward, it does not require that data must be available for the particular document or query in question, but it can utilize such specific data if it is available. The model is one way to resolve the difficulty of combining two marginal views in probabilistic retrieval.