Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Celso França

dblp:195/8391 · DBLP profile ↗
← Back
10ranked-venue papers
4as first author
7since 2021 · last 2025
0000-0002-0251-7172ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 5 · 1 first-author · 5 since 2021Artificial intelligence and machine learning · 3 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Data mining · 92% Information retrieval · 8%
Artificial intelligence
1 paper
Efficient and distributed learning · 77% Language models and text generation · 23%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › text mining
text classification
1.522025
Optimizing Tail-Head Trade-off for Extreme Multi-Label Text Classification (XMTC) with RAG-Labels and a Dynamic Two-Stage Retrieval and Fusion Pipeline · SIGIR 2025
An Effective, Efficient, and Scalable Confidence-based Instance Selection Framework for Transformer-Based Text Classification · SIGIR 2023
Data mining › text mining › text classification
extreme multi-label text classification
0.912025
Optimizing Tail-Head Trade-off for Extreme Multi-Label Text Classification (XMTC) with RAG-Labels and a Dynamic Two-Stage Retrieval and Fusion Pipeline · SIGIR 2025
Machine learning › Efficient and distributed learning
data selection
0.712023
An Effective, Efficient, and Scalable Confidence-based Instance Selection Framework for Transformer-Based Text Classification · SIGIR 2023
Data mining › data reduction
instance selection
0.712023
An Effective, Efficient, and Scalable Confidence-based Instance Selection Framework for Transformer-Based Text Classification · SIGIR 2023
Information retrieval
retrieval-augmented generation
0.312025
Optimizing Tail-Head Trade-off for Extreme Multi-Label Text Classification (XMTC) with RAG-Labels and a Dynamic Two-Stage Retrieval and Fusion Pipeline · SIGIR 2025
Natural language and speech › Language models and text generation
transformer fine-tuning
0.212023
An Effective, Efficient, and Scalable Confidence-based Instance Selection Framework for Transformer-Based Text Classification · SIGIR 2023

Methods — techniques the papers use, named apart from their topics

weak classifiers · 1.3iterative heuristics · 1.3calibration · 1.3sparse retrieval · 0.9dense retrieval · 0.9RAG · 0.9
YearPublicationVenuePosition
2025 Optimizing Tail-Head Trade-off for Extreme Multi-Label Text Classification (XMTC) with RAG-Labels and a Dynamic Two-Stage Retrieval and Fusion Pipeline
abstract
We tackle Extreme Multi-Label Text Classification (XMTC), which involves assigning relevant labels to texts from a huge label space. Attempting to optimize the underexplored tail-head trade-off, we address the XMTC task through its core challenges of volume, skewness, and quality by proposing xCoRetriev, a novel two-stage retrieving and fusing ranking pipeline. Our pipeline addresses the volume challenge by dynamically slicing the large label space; it also tackles the skewness challenge by favoring the tail labels while fusing sparse and dense retrievers. Finally, xCoRetriev faces the quality challenge by enhancing the label space with Retrieval-Augmented Generated (RAG)-labels. Our experiments with four XMTC benchmarks with hundreds of thousands of text documents and labels against six state-of-the-art XMTC baselines demonstrate xCoRetriev's strengths in terms of: (i)~scalability for large label spaces, being among the most efficient methods at training and prediction; (ii)~effectiveness in the face of high skewness, with gains of up to 48% in propensity-scored metrics against the best state-of-the-art baselines; and (iii)~capability of handling very noisy datasets by exploiting RAG-labels.
Celso França, Gestefane Rabbi, Thiago Salles, Washington Cunha, Leonardo Rocha 0001, Marcos André Gonçalves
SIGIR1
2025 Risk-sensitive optimization of neural deep learning ranking models with applications in ad-hoc retrieval and recommender systems
Pedro Henrique Silva Rodrigues, Daniel Xavier de Sousa, Celso França, Gestefane Rabbi, Thierson Couto, Marcos André Gonçalves
Inf. Process. Manag.3
2024 On Representation Learning-based Methods for Effective, Efficient, and Scalable Code Retrieval
Celso França, Rennan C. Lima, Cláudio M. V. de Andrade, Washington Cunha, Pedro O. S. Vaz de Melo, Berthier A. Ribeiro-Neto, Leonardo Rocha 0001, Rodrygo L. T. Santos, Adriana S. Pagano, Marcos André Gonçalves
Neurocomputing1
2024 CreativeStone: A Creativity Booster for Hearthstone Card Decks
abstract
Digital Collectible Card Games (DCCG) rely on human expertise to create competitive card decks. The most effective decks are shared and become popular among players through online communities. Players then keep enhancing those decks by replacing cards and testing those new deck variations in online arenas. This fine-tuning process is time-consuming and most of the time leads to small improvements in the players win rate. This paper presents CreativeStone, a creativity booster for Hearthstone card decks. Our creativity-guided approach uses a genetic algorithm and the Regent-Dependent Creativity (RDC) metric to identify the core cards of an existing deck, and then improves it towards a more valuable and novel deck by adding cards that are synergic to the core cards, but also different from the ones in the original deck. Our experimental results show that CreativeStone can boost even legendary decks, outperforming handcrafted ones by 21% in win rate.
Celso França, Zisen Zhou, Carolina Fernanda da Silva, Cibele Simões de Oliveira Santos, Lucas Braga Ferreira, Lucas Henrique Pereira, Marcos Pablo Souza de Almeida, Marina Iolanda Oliveira, Thaís Damásio, Vinícius Pacheco, Fabrício Góes
IEEE Trans. Games1
2023 An Effective, Efficient, and Scalable Confidence-based Instance Selection Framework for Transformer-Based Text Classification
abstract
Transformer-based deep learning is currently the state-of-the-art in many NLP and IR tasks. However, fine-tuning such Transformers for specific tasks, especially in scenarios of ever-expanding volumes of data with constant re-training requirements and budget constraints, is costly (computationally and financially) and energy-consuming. In this paper, we focus on Instance Selection (IS) - a set of methods focused on selecting the most representative documents for training, aimed at maintaining (or improving) classification effectiveness while reducing total time for training (or fine-tuning). We propose E2SC-IS -- Effective, Efficient, and Scalable Confidence-Based IS -- a two-step framework with a particular focus on Transformers and large datasets. E2SC-IS estimates the probability of each instance being removed from the training set based on scalable, fast, and calibrated weak classifiers. E2SC-IS also exploits iterative heuristics to estimate a near-optimal reduction rate. Our solution can reduce the training sets by 29% on average while maintaining the effectiveness in all datasets, with speedup gains up to 70%, scaling for very large datasets (something that the baselines cannot do).
Washington Cunha, Celso França, Guilherme Fonseca, Leonardo Rocha 0001, Marcos André Gonçalves
SIGIR2
2023 On the class separability of contextual embeddings representations - or "The classifier does not matter when the (text) representation is so good!"
Cláudio M. V. de Andrade, Fabiano Muniz Belém, Washington Cunha, Celso França, Felipe Viegas, Leonardo Rocha 0001, Marcos André Gonçalves
Inf. Process. Manag.4
2021 On the cost-effectiveness of neural and non-neural approaches and representations for text classification: A comprehensive comparative study
Washington Cunha, Vítor Mangaravite, Christian Gomes, Sérgio D. Canuto, Elaine Resende, Cecilia Nascimento, Felipe Viegas, Celso França, Wellington Santos Martins, Jussara M. Almeida, Thierson Couto, Leonardo Rocha 0001, Marcos André Gonçalves
Inf. Process. Manag.8
2017 Creative Flavor Pairing: Using RDC Metric to Generate and Assess Ingredients Combination
Alvaro Amorim, Fabrício Góes, Alysson Ribeiro Da Silva, Celso França
ICCC4
2017 HoningStone: Building Creative Combos With Honing Theory for a Digital Card Game
abstract
In recent years, online digital games have left behind the status of entertainment sources to become also professional electronic sports. Worldwide championships offer prizes up to millions of dollars for the best competitors and/or teams among different game categories such as digital collectible card games (DCCG), multiplayer online battle arena, etc. Hearthstone, by Blizzard Entertainment, is a DCCG that has an increasing number of players up to the millions. In this game, individual players compete in one-versus-one matches in alternating turns, until a player is defeated. The greatest challenge in this game is to build a deck of cards and a strategy to combine these cards in order to be competitive against other players without a priori knowledge about their decks and strategies. This is a daunting task that requires deep knowledge of each existing card and great amount of creativity to surprise adversaries in this very adaptive environment. This paper presents a computational system, called HoningStone, that automatically generates creative card combos based on the honing theory of creativity. Our experimental results show that HoningStone can generate combos that are more creative than a greedy randomized algorithm driven by a creativity metric.
Fabrício Góes, Alysson Ribeiro Da Silva, João Saffran, Alvaro Amorim, Celso França, Tiago Zaidan, Bernardo M. P. Olimpio, Lucas R. O. Alves, Hugo Morais, Shirley Luana, Carlos Martins
IEEE Trans. Comput. Intell. AI Games5
2016 Regent-Dependent Creativity: A Domain Independent Metric for the Assessment of Creative Artifacts
Celso França, Fabrício Góes, Alvaro Amorim, Rodrigo Caetano Rocha, Alysson Ribeiro Da Silva
ICCC1