2011 - IEEE Fellow For contributions to the development of computer science
2009 - ACM Fellow For contributions to the development of algorithms and information retrieval techniques.
Ricardo Baeza-Yates mostly deals with Information retrieval, World Wide Web, Algorithm, Search engine and Web search query. Information retrieval is frequently linked to Web page in his study. His work on Search algorithm as part of general Algorithm research is frequently linked to Uncompressed video, bridging the gap between disciplines.
His research investigates the connection between Search engine and topics such as Query expansion that intersect with issues in Database. His work carried out in the field of The Internet brings together such families of science as Service quality, Information science, Relation and Okapi BM25. He regularly links together related areas like Electronically stored information in his Adversarial information retrieval studies.
The scientist’s investigation covers issues in Information retrieval, World Wide Web, Search engine, Web search query and Algorithm. His Information retrieval research focuses on subjects like Artificial intelligence, which are linked to Machine learning. His Search engine research is multidisciplinary, incorporating elements of Data mining, The Internet and Search engine indexing.
The concepts of his Web search query study are interwoven with issues in Query expansion and Database. Ricardo Baeza-Yates has researched Query expansion in several fields, including Query optimization and Sargable. His Algorithm study combines topics in areas such as Commentz-Walter algorithm, Approximate string matching, String searching algorithm, Theoretical computer science and Pattern matching.
His main research concerns Information retrieval, World Wide Web, Artificial intelligence, Context and Dyslexia. His Information retrieval study often links to related topics such as Ranking. His World Wide Web study incorporates themes from Variety and Set.
His research integrates issues of Machine learning and Natural language processing in his study of Artificial intelligence. His study on Dyslexia also encompasses disciplines like
Ricardo Baeza-Yates focuses on Information retrieval, Artificial intelligence, Search engine, World Wide Web and Dyslexia. His work on Web search query, Search engine indexing and Text retrieval as part of general Information retrieval research is frequently linked to Gram and Index, thereby connecting diverse disciplines of science. His work in Artificial intelligence tackles topics such as Natural language processing which are related to areas like Linguistics and Set.
His research on Search engine also deals with topics like
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Modern Information Retrieval
Ricardo A. Baeza-Yates;Berthier Ribeiro-Neto.
Information Retrieval: Data Structures and Algorithms
William B. Frakes;Ricardo Baeza-Yates.
Searching in metric spaces
Edgar Chávez;Gonzalo Navarro;Ricardo Baeza-Yates;José Luis Marroquín.
ACM Computing Surveys (2001)
A new approach to text searching
Ricardo Baeza-Yates;Gaston H. Gonnet.
Communications of The ACM (1992)
Handbook of algorithms and data structures : in Pascal and C
G. H. Gonnet;R. Baeza-Yates.
Query recommendation using query logs in search engines
Ricardo Baeza-Yates;Carlos Hurtado;Marcelo Mendoza.
extending database technology (2004)
Modern Information Retrieval: The concepts and technology behind search
Ricardo Baeza-Yates;Berthier Ribeiro-Neto.
Searching in the Plane
R.A. Baezayates;J.C. Culberson;G.J.E. Rawlins.
Information & Computation (1993)
Donna Harman;R. Baeza-Yates;Edward Fox;W. Lee.
Information Retrieval (1992)
New indices for text: PAT Trees and PAT arrays
Gaston H. Gonnet;Ricardo A. Baeza-Yates;Tim Snider.
Information Retrieval (1992)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: