Jose Luis Redondo Garcia

Jose Luis Redondo Garcia

Auto-generated profile, based on publicly available information

Jose Luis Redondo Garcia

Spotify, Madrid, Spain

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
23 June 2025
Verified
Conference Paper
Open access
KPKonstantina Palla
Konstantina Palla
JGJosé Luis Redondo García
José Luis Redondo García
CHClaudia Hauff
Claudia Hauff
FFFrancesco Fabbri
Francesco Fabbri
ADAndreas Damianou
Andreas Damianou
MLMounia Lalmas
Mounia Lalmas

25 August 2020 in Semantic Web: – Interoperability, Usability, Applicability
Verified
Journal Article
Open access
PDF file
CBCarlos Badenes-Olmedo
Carlos Badenes-Olmedo
JRJosé Luis Redondo-García
José Luis Redondo-García
OCOscar Corcho
Oscar Corcho
Searching for similar documents and exploring major themes covered across groups of documents are common activities when browsing collections of scientific papers. This manual knowledge-intensive task can become less tedious and even lead to unexpected relevant findings if unsupervised algorithms are applied to help researchers. Most text mining algorithms represent documents in a common feature space that abstract them away from the specific sequence of words used in them. Probabilistic Topic Models reduce that feature space by annotating documents with thematic information. Over this low-dimensional latent space some locality-sensitive hashing algorithms have been proposed to perform document similarity search. However, thematic information gets hidden behind hash codes, preventing thematic exploration and limiting the explanatory capability of topics to justify content-based similarities. This paper presents a novel hashing algorithm based on approximate nearest-neighbor techniques that uses hierarchical sets of topics as hash codes. It not only performs efficient similarity searches, but also allows extending those queries with thematic restrictions explaining the similarity score from the most relevant topics. Extensive evaluations on both scientific and industrial text datasets validate the proposed algorithm in terms of accuracy and efficiency.

27 September 2026
Verified
Conference Paper
Open access
EPEnrico Palumbo
Enrico Palumbo
ATAlexandre Tamborrino
Alexandre Tamborrino
VOVictor Ode
Victor Ode
BLBenjamin Lacker
Benjamin Lacker
AEAdrià Casas Escoda
Adrià Casas Escoda
CCChristine Doig Cardet
Christine Doig Cardet

22 March 2026
Verified
Conference Paper
Open access
AAAntonios Anagnostou
Antonios Anagnostou
JGJose Luis Redondo Garcia
Jose Luis Redondo Garcia
EJEmelie Jin
Emelie Jin
JWJonathan Warburton
Jonathan Warburton
VRVinay Rao
Vinay Rao
MLMounia Lalmas
Mounia Lalmas