Ricardo Baeza-Yates

Ricardo Baeza-Yates

Auto-generated profile, based on publicly available information

Ricardo Baeza-Yates

KTH Royal Institute of Technology, Stockholm, Sweden and Universitat Pompeu Fabra, Barcelona, Spain

Research Focus & Metrics

Academic Career Length

40Years (1987-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2001 in ACM Computing Surveys
Verified
Journal Article
Open access
PDF file
ECEdgar Chávez
Edgar Chávez
GNGonzalo Navarro
Gonzalo Navarro
RBRicardo Baeza-Yates
Ricardo Baeza-Yates
JMJosé Luis Marroquín
José Luis Marroquín
The problem of searching the elements of a set that are close to a given query element under some similarity criterion has a vast number of applications in many branches of computer science, from pattern recognition to textual and multimedia information retrieval. We are interested in the rather general case where the similarity criterion defines a metric space, instead of the more restricted case of a vector space. Many solutions have been proposed in different areas, in many cases without cross-knowledge. Because of this, the same ideas have been reconceived several times, and very different presentations have been given for the same approaches. We present some basic results that explain the intrinsic difficulty of the search problem. This includes a quantitative definition of the elusive concept of "intrinsic dimensionality." We also present a unified view of all the known proposals to organize metric spaces, so as to be able to understand them under a common framework. Most approaches turn out to be variations on a few different concepts. We organize those works in a taxonomy that allows us to devise new algorithms from combinations of concepts not noticed before because of the lack of communication between different communities. We present experiments validating our results and comparing the existing approaches. We finish with recommendations for practitioners and open questions for future development.

23 May 2018 in Communications of the ACM
Verified
Journal Article
Open access
RBRicardo Baeza-Yates
Ricardo Baeza-Yates
Bias in Web data and use taints the algorithms behind Web-based applications, delivering equally biased results.

6 November 2017
Verified
Conference Paper
Open access
PDF file
MZMeike Zehlike
Meike Zehlike
FBFrancesco Bonchi
Francesco Bonchi
CCCarlos Castillo
Carlos Castillo
SHSara Hajian
Sara Hajian
MMMohamed Megahed
Mohamed Megahed
RBRicardo Baeza-Yates
Ricardo Baeza-Yates
In this work, we define and solve the Fair Top-k Ranking problem, in which we want to determine a subset of k candidates from a large pool of n >> k candidates, maximizing utility (i.e., select the "best" candidates) subject to group fairness criteria. Our ranked group fairness definition extends group fairness using the standard notion of protected groups and is based on ensuring that the proportion of protected candidates in every prefix of the top-k ranking remains statistically above or indistinguishable from a given minimum. Utility is operationalized in two ways: (i) every candidate included in the top-$k$ should be more qualified than every candidate not included; and (ii) for every pair of candidates in the top-k, the more qualified candidate should be ranked above. An efficient algorithm is presented for producing the Fair Top-k Ranking, and tested experimentally on existing datasets as well as new datasets released with this paper, showing that our approach yields small distortions with respect to rankings that maximize utility without considering fairness criteria. To the best of our knowledge, this is the first algorithm grounded in statistical tests that can mitigate biases in the representation of an under-represented group along a ranked list.Comment: Accepted at the 26th ACM International Conference on Information and Knowledge Management (CIKM'17). 10 page

1 October 1992 in Communications of the ACM
Verified
Journal Article
Open access
RBRicardo Baeza-Yates
Ricardo Baeza-Yates
GGGaston H. Gonnet
Gaston H. Gonnet

1 January 2004
Verified
Book Chapter
Closed access
PDF file
RBRicardo Baeza-Yates
Ricardo Baeza-Yates
CHCarlos Hurtado
Carlos Hurtado
Marcelo MendozaMarcelo Mendoza
Marcelo Mendoza

1 January 2005 in Biological Research
Verified
Journal Article
Open access
PDF file
Lee MeiselLee Meisel
Lee Meisel
BFBeatriz Fonseca
Beatriz Fonseca
SGSusana González
Susana González
RBRicardo Baeza-Yates
Ricardo Baeza-Yates
VCVeronica Cambiazo
Veronica Cambiazo
HSHERMAN SILVA
HERMAN SILVA
Prunus persica has been proposed as a genomic model for deciduous trees and the Rosaceae family. Optimized protocols for RNA isolation are necessary to further advance studies in this model species such that functional genomics analyses may be performed. Here we present an optimized protocol to rapidly and efficiently purify high quality total RNA from peach fruits (Prunus persica). Isolating high-quality RNA from fruit tissue is often difficult due to large quantities of polysaccharides and polyphenolic compounds that accumulate in this tissue and co-purify with the RNA. Here we demonstrate that a modified version of the method used to isolate RNA from pine trees and the woody plant Cinnamomun tenuipilum is ideal for isolating high quality RNA from the fruits of Prunus persica. This RNA may be used for many functional genomic based experiments such as RT-PCR and the construction of large-insert cDNA libraries.