3 papers
cs.LG2025
Bayesian Network Structural Consensus via Greedy Min-Cut Analysis
Pablo Torrijos, José M. Puerta, Juan A. Aledo +1
This paper presents the Min-Cut Bayesian Network Consensus (MCBNC) algorithm, a greedy method for structural consensus of Bayesian Networks (BNs), with applications in federated le…
cs.LG2025
ODTE -- An ensemble of multi-class SVM-based oblique decision trees
Ricardo Montañana, José A. Gámez, José M. Puerta
We propose ODTE, a new ensemble that uses oblique decision trees as base classifiers. Additionally, we introduce STree, the base algorithm for growing oblique decision trees, which…
cs.AI2025
A consensus set for the aggregation of partial rankings: the case of the Optimal Set of Bucket Orders Problem
Juan A. Aledo, José A. Gámez, Alejandro Rosete
In rank aggregation problems (RAP), the solution is usually a consensus ranking that generalizes a set of input orderings. There are different variants that differ not only in term…