Lúcio F. D. Santos

dblp:52/10363 · also Lucio Fernandes Dutra Santos · DBLP profile ↗
← Back
9ranked-venue papers in the field
3as first author
4since 2021 · last 2024
0000-0002-0495-4763ORCID · verified

Domains — venue-derived; a paper can count in several

Database Systems & Data Management · 8 (2 first)Information Retrieval & Web Search · 1 (1 first)
YearPublicationVenuePosition
2024 Enriching Hierarchical Navigable Small World Searches with Result Diversification
Mauro Weber, João Silva-Leite, Lúcio F. D. Santos, Daniel de Oliveira 0001, Marcos V. N. Bedo
DEXA (1)3
2023 Adding Result Diversification to kNN-Based Joins in a Map-Reduce Framework
Vinícius Souza, Luiz Olmes Carvalho, Daniel de Oliveira 0001, Marcos V. N. Bedo, Lúcio F. D. Santos
DEXA (1)5
2023 Pushing diversity into higher dimensions: The LID effect on diversified similarity searching
Daniel L. Jasbick, Lúcio F. D. Santos, Paulo Mazzoncini de Azevedo Marques, Agma J. M. Traina, Daniel de Oliveira 0001, Marcos V. N. Bedo
Inf. Syst.2
2022 ORTree: Tuning Diversified Similarity Queries by Means of Data Partitioning
João V. O. Novaes, Lúcio F. D. Santos, Agma J. M. Traina, Caetano Traina Jr.
ADBIS2
2020 Some Branches May Bear Rotten Fruits: Diversity Browsing VP-Trees
Daniel L. Jasbick, Lúcio F. D. Santos, Daniel de Oliveira 0001, Marcos V. N. Bedo
SISAP2
2018 Exploring Diversified Similarity with Kundaha
abstract
Exploring large medical image sets by means of traditional similarity query criteria (e.g., neighborhood) can be fruitless if retrieved images are too similar among themselves. This demonstration introduces Kundaha, an exploration tool that assists experts in retrieving and navigating on results from a diversified similarity perspective of user-posed queries. Its implementation includes a wide set of metrics, descriptors, and indexes for enhancing query execution. Users can combine such features with diversified similarity criteria for the organized exploration of result sets and also employ relevance feedback cycles for finding new query-based viewpoints.
Lúcio F. D. Santos, Gustavo Blanco, Daniel de Oliveira 0001, Agma J. M. Traina, Caetano Traina Jr., Marcos V. N. Bedo
CIKM1
2015 Similarity Joins and Beyond: An Extended Set of Binary Operators with Order
Luiz Olmes Carvalho, Lúcio F. D. Santos, Willian D. Oliveira, Agma J. M. Traina, Caetano Traina Jr.
SISAP2
2015 Diversity in Similarity Joins
Lúcio F. D. Santos, Luiz Olmes Carvalho, Willian D. Oliveira, Agma J. M. Traina, Caetano Traina Jr.
SISAP1
2013 Parameter-free and domain-independent similarity search with diversity
abstract
New operators to execute similarity-based queries over multimedia data stored in Database Management Systems are increasingly demanded. However, searching in very large datasets, the basic operators often return elements too much similar both to the query center and to themselves, reducing the answer's utility. In this paper, we tackle the problem of providing diversity to similarity query results, and define techniques to assure that each element in the result set is different enough from the others. Existing techniques compel the user to define either a parameter to trade among similarity and diversity or a minimum similarity between result elements. Distinctly, our approach provides similarity queries with diversification using the influence concept, which automatically estimates the inherent diversity between the result set elements requiring no user-defined parameters. Furthermore, our technique can be applied over any data represented in a metric space, so it is both parameter and application-domain independent. The "Better Results with Influence Diversification" (BRID) technique is the basis to the k-Diverse Nearest Neighbor (BRIDk) and to the Range Diverse (BRIDr) algorithms, which execute k-nearest neighbor and range queries with diversification, showing that the technique can be applied to diversify any type of similarity queries. We also define a way to measure the diversification degree in a result set. Through a detailed experimental evaluation using our approach, we show that BRID outperforms the existing methods regarding both query diversification quality and execution times, being at least two orders of magnitude faster than the best existing approaches.
Lúcio F. D. Santos, Willian D. Oliveira, Mônica Ribeiro Porto Ferreira, Agma J. M. Traina, Caetano Traina Jr.
SSDBM1