2025
Authors
Andrade, C; Ribeiro, RP; Gama, J;
Publication
INTELLIGENT SYSTEMS, BRACIS 2024, PT III
Abstract
Latent Dirichlet Allocation (LDA) is a fundamental method for clustering short text streams. However, when applied to large datasets, it often faces significant challenges, and its performance is typically evaluated in domain-specific datasets such as news and tweets. This study aims to fill this gap by evaluating the effectiveness of short text clustering methods in a large and diverse e-commerce dataset. We specifically investigate how well these clustering algorithms adapt to the complex dynamics and larger scale of e-commerce text streams, which differ from their usual application domains. Our analysis focuses on the impact of high homogeneity scores on the reported Normalized Mutual Information (NMI) values. We particularly examine whether these scores are inflated due to the prevalence of single-element clusters. To address potential biases in clustering evaluation, we propose using the Akaike Information Criterion (AIC) as an alternative metric to reduce the formation of single-element clusters and provide a more balanced measure of clustering performance. We present new insights for applying short text clustering methodologies in real-world situations, especially in sectors like e-commerce, where text data volumes and dynamics present unique challenges.
2025
Authors
Muhammad, AR; Aguiar, A; Mendes-Moreira, J;
Publication
INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING - IDEAL 2024, PT II
Abstract
This study investigates the impact of class imbalance and its potential interplay with other factors on machine learning models for transportation mode classification, utilising two real-world GPS trajectory datasets. A Random Forest model serves as the baseline, demonstrating strong performance on the relatively balanced dataset but experiencing significant degradation on the imbalanced one. To mitigate this effect, we explore various state-of-the-art class imbalance learning techniques, finding only marginal improvements. Resampling the fairly balanced dataset to replicate the imbalanced distribution suggests that factors beyond class imbalance are at play. We hypothesise and provide preliminary evidence for class overlap as a potential contributing factor, underscoring the need for further investigation into the broader range of classification difficulty factors. Our findings highlight the importance of balanced class distributions and a deeper understanding of factors such as class overlap in developing robust and generalisable models for transportation mode detection.
2025
Authors
Ferreira, A; Almeida, J; Matos, A; Silva, E;
Publication
ROBOTICS
Abstract
Due to space and energy restrictions, lightweight autonomous underwater vehicles (AUVs) are usually fitted with low-power processing units, which limits the ability to run demanding applications in real time during the mission. However, several robotic perception tasks reveal a parallel nature, where the same processing routine is applied for multiple independent inputs. In such cases, leveraging parallel execution by offloading tasks to a GPU can greatly enhance processing speed. This article presents a collection of generic matrix manipulation kernels, which can be combined to develop parallelized perception applications. Taking advantage of those building blocks, we report a parallel implementation for the 3DupIC algorithm-a probabilistic scan matching method for sonar scan registration. Tests demonstrate the algorithm's real-time performance, enabling 3D sonar scan matching to be executed in real time onboard the EVA AUV.
2025
Authors
Pedroso, JP; Ikeda, S;
Publication
Eur. J. Oper. Res.
Abstract
This paper addresses the problem of maximizing the expected size of a matching in the case of unreliable vertices and/or edges. The assumption is that the solution is built in several steps. In a given step, edges with successfully matched vertices are made permanent; but upon edge or vertex failures, the remaining vertices become eligible for reassignment. This process may be repeated a given number of times, and the objective is to end with the overall maximum number of matched vertices. An application of this problem is found in kidney exchange programs, going on in several countries, where a vertex is an incompatible patient–donor pair and an edge indicates cross-compatibility between two pairs; the objective is to match these pairs so as to maximize the number of served patients. A new scheme is proposed for matching rearrangement in case of failure, along with a prototype algorithm for computing the optimal expectation for the number of matched edges (or vertices), considering a possibly limited number of rearrangements. Computational experiments reveal the relevance and limitations of the algorithm, in general terms and for the kidney exchange application. © 2025 The Authors
2025
Authors
da Silva, EM; Schneider, D; Miceli, C; Correia, A;
Publication
Informatics
Abstract
2025
Authors
Tinoco, V; Silva, MF; Santos, FN; Morais, R; Magalhaes, SA; Oliveira, PM;
Publication
INTERNATIONAL JOURNAL OF DYNAMICS AND CONTROL
Abstract
With the global population on the rise and a declining agricultural labor force, the realm of robotics research in agriculture, such as robotic manipulators, has assumed heightened significance. This article undertakes a comprehensive exploration of the latest advancements in controllers tailored for robotic manipulators. The investigation encompasses an examination of six distinct controller paradigms, complemented by the presentation of three exemplars for each category. These paradigms encompass: (i) adaptive control, (ii) sliding mode control, (iii) model predictive control, (iv) robust control, (v) fuzzy logic control and (vi) neural network control. The article further introduces and presents comparative tables for each controller category. These controllers excel in tracking trajectories and efficiently reaching reference points with rapid convergence. The key point of divergence among these controllers resides in their inherent complexity.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.