1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.AI2023
On the Complexity of the Bipartite Polarization Problem: from Neutral to Highly Polarized Discussions
Teresa Alsinet, Josep Argelich, Ramón Béjar +1
The Bipartite Polarization Problem is an optimization problem where the goal is to find the highest polarized bipartition on a weighted and labelled graph that represents a debate…
cs.AI2023★ 1 cited
On Logic-Based Explainability with Partially Specified Inputs
Ramón Béjar, António Morgado, Jordi Planes +1
In the practical deployment of machine learning (ML) models, missing data represents a recurring challenge. Missing data is often addressed when training ML models. But missing dat…