Alejandro Moreo

Dr. Alejandro Moreo


Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
1 August 2012 in Expert Systems with Applications
Verified
Journal Article
Closed access
AMAlejandro Moreo
Alejandro Moreo
MRM. Romero
M. Romero
JCJ.L. Castro
J.L. Castro
JZJ.M. Zurita
J.M. Zurita

7 July 2016
Verified
Conference Paper
Open access
PDF file
AMAlejandro Moreo
Alejandro Moreo
AEAndrea Esuli
Andrea Esuli
FSFabrizio Sebastiani
Fabrizio Sebastiani
The accuracy of many classification algorithms is known to suffer when the data are imbalanced (i.e., when the distribution of the examples across the classes is severely skewed). Many applications of binary text classification are of this type, with the positive examples of the class of interest far outnumbered by the negative examples. Oversampling (i.e., generating synthetic training examples of the minority class) is an often used strategy to counter this problem. We present a new oversampling method specifically designed for classifying data (such as text) for which the distributional hypothesis holds, according to which the meaning of a feature is somehow determined by its distribution in large corpora of data. Our Distributional Random Oversampling method generates new random minority-class synthetic documents by exploiting the distributional properties of the terms in the collection. We discuss results we have obtained on the Reuters-21578, OHSUMED-S, and RCV1-v2 datasets.

19 February 2021 in Data Mining and Knowledge Discovery
Verified
Journal Article
Closed access
PDF file
AMAlejandro Moreo
Alejandro Moreo
AEAndrea Esuli
Andrea Esuli
FSFabrizio Sebastiani
Fabrizio Sebastiani

17 October 2018
Verified
Conference Paper
Open access
PDF file
AEAndrea Esuli
Andrea Esuli
AMAlejandro Moreo
Alejandro Moreo
FSFabrizio Sebastiani
Fabrizio Sebastiani

17 January 2025 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
WCWashington Cunha
Washington Cunha
AMAlejandro Moreo
Alejandro Moreo
AEAndrea Esuli
Andrea Esuli
FSFabrizio Sebastiani
Fabrizio Sebastiani
LRLeonardo Rocha
Leonardo Rocha
MGMarcos André Gonçalves
Marcos André Gonçalves
Fine-tuning transformer-based deep-learning models are currently at the forefront of natural language processing (NLP) and information retrieval (IR) tasks. However, fine-tuning these transformers for specific tasks, especially when dealing with ever-expanding volumes of data, constant retraining requirements, and budget constraints, can be computationally and financially costly, requiring substantial energy consumption and contributing to carbon dioxide emissions. This article focuses on advancing the state-of-the-art (SOTA) on instance selection (IS)—a range of document filtering techniques designed to select the most representative documents for the sake of training. The objective is to either maintain or enhance classification effectiveness while reducing the overall training (fine-tuning) total processing time. In our prior research, we introduced the E2SC framework, a redundancy-oriented IS method focused on transformers and large datasets—currently the state-of-the-art in IS. Nonetheless, important research questions remained unanswered in our previous work, mostly due to E2SC’s sole emphasis on redundancy. In this article, we take our research a step further by proposing biO-IS— an extended bi - o bjective i nstance s election solution, a novel IS framework aimed at simultaneously removing redundant and noisy instances from the training. biO-IS estimates redundancy based on scalable, fast, and calibrated weak classifiers and captures noise with the support of a new entropy-based step. We also propose a novel iterative process to estimate near-optimum reduction rates for both steps. Our extended solution is able to reduce the training sets by 41% on average (up to 60%) while maintaining the effectiveness in all tested datasets, with speedup gains of 1.67 on average (up to 2.46x). No other baseline, not even our previous SOTA solution, was capable of achieving results with this level of quality, considering the tradeoff among training reduction, effectiveness, and speedup. To ensure reproducibility, our documentation, code, and datasets can be accessed on GitHub— https://github.com/waashk/bio-is .

16 September 2022 in PLOS ONE
Verified
Journal Article
Open access
PDF file
AMAlejandro Moreo
Alejandro Moreo
FSFabrizio Sebastiani
Fabrizio Sebastiani
Sentiment quantification is the task of training, by means of supervised learning, estimators of the relative frequency (also called “prevalence”) of sentiment-related classes (such asPositive,Neutral,Negative) in a sample of unlabelled texts. This task is especially important when these texts are tweets, since the final goal of most sentiment classification efforts carried out on Twitter data is actually quantification (and not the classification of individual tweets). It is well-known that solving quantification by means of “classify and count” (i.e., by classifying all unlabelled items by means of a standard classifier and counting the items that have been assigned to a given class) is less than optimal in terms of accuracy, and that more accurate quantification methods exist. Gao and Sebastiani 2016 carried out a systematic comparison of quantification methods on the task of tweet sentiment quantification. In hindsight, we observe that the experimentation carried out in that work was weak, and that the reliability of the conclusions that were drawn from the results is thus questionable. We here re-evaluate those quantification methods (plus a few more modern ones) on exactly the same datasets, this time following a now consolidated and robust experimental protocol (which also involves simulating the presence, in the test data, of class prevalence values very different from those of the training set). This experimental protocol (even without counting the newly added methods) involves a number of experiments 5,775 times larger than that of the original study. Due to the above-mentioned presence, in the test data, of samples characterised by class prevalence values very different from those of the training set, the results of our experiments are dramatically different from those obtained by Gao and Sebastiani, and provide a different, much more solid understanding of the relative strengths and weaknesses of different sentiment quantification methods.