Stephen Robertson | |
|---|---|
| Born | 6 April 1946 |
| Nationality | British |
| Alma mater | Cambridge, City University, University College London |
| Known for | Work on information retrieval and inverse document frequency |
| Awards | Gerard Salton Award (2000), Tony Kent Strix award (1998), ACM Fellow (2013) |
| Scientific career | |
| Fields | Computer science |
| Doctoral advisor | B.C (Bertie) Brookes |
| Website | staff |
Stephen Robertson is a British computer scientist. He is known for his work on probabilistic information retrieval together with Karen Spärck Jones[1] and the Okapi BM25 weighting model.[2][3]
Okapi BM25 is very successful in experimental search evaluations and found its way in many information retrieval systems and products, including open source search systems like Lucene, Lemur, Xapian, and Terrier. BM25 is used as one of the most important signals in large web search engines, certainly in Microsoft Bing, and probably in other web search engines too. BM25 is also used in various other Microsoft products such as Microsoft SharePoint and SQL Server.[4]
After completing his undergraduate degree in mathematics at Cambridge University, he took an MS at City University, and then worked for ASLIB. He earned his PhD at University College London in 1976 under the renowned statistician and scholar B. C. Brookes.[5] He then returned to City University working there from 1978 until 1998 in the Department of Information Science, continuing as a part-time professor and subsequently as professor emeritus. He is also a fellow of Girton College, Cambridge University. Now retired, Robertson is Professor Emeritus at City University, and a Visiting Professor in the Department of Computer Science at UCL.[6]
YouTube Encyclopedic
-
1/3Views:1 528 4412 124662
-
How To Think Like A Programmer
-
Prof. David Robertson - Programming the Social Computer
-
Allen Newell, 1975 ACM A. M. Turing Award Recipient
Transcription
References
- ^ Robertson, S. E.; Spärck Jones, K. (1976). "Relevance weighting of search terms". Journal of the American Society for Information Science. 27 (3): 129. doi:10.1002/asi.4630270302.
- ^ Spärck Jones, K.; Walker, S.; Robertson, S. E. (2000). "A probabilistic model of information retrieval: Development and comparative experiments: Part 1". Information Processing & Management. 36 (6): 779–808. CiteSeerX 10.1.1.134.6108. doi:10.1016/S0306-4573(00)00015-7. S2CID 1965284.
- ^ Spärck Jones, K.; Walker, S.; Robertson, S. E. (2000). "A probabilistic model of information retrieval: Development and comparative experiments: Part 2". Information Processing & Management. 36 (6): 809–840. doi:10.1016/S0306-4573(00)00016-9.
- ^ Hiemstra, D.; Tait, J.; MacFarlane, A.; Belkin, N. J. (2013). "Celebrating Stephen Robertson's Retirement". BCS IRSG Informer.
- ^ Robertson, Stephen (December 2013). "Brief CV". Stephen Robertson, Information Science. Retrieved 19 November 2022.
- ^ "The Stephen Robertson Prize | UCL UCL Centre for Digital Humanities".
Publications
- Robertson, Stephen; Zaragoza, Hugo (2009). The Probabilistic Relevance Framework: BM25 and Beyond (PDF). NOW Publishers, Inc. ISBN 978-1-60198-308-4.
- Robertson, Stephen (2020). B C, Before Computers. Open Book Publishers. doi:10.11647/OBP.0225. ISBN 978-1-80064-029-0. S2CID 226361310.
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
This page was last edited on 17 September 2023, at 16:53