Juan Baz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Juan Baz has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Susana Montes
University of Oviedo
10 shared publications - Irene Díaz
University of Oviedo
9 shared publications Irene Díaz
5 shared publicationsSusana Montes
Department of Statistics and O.R. and Mathematics Didactics, University of Oviedo, Oviedo, Spain
4 shared publications- Franco Pellerey
Politecnico di Torino
3 shared publications Gleb Beliakov
2 shared publications
Latest Publications
- Open Access
- 26 August 2026
- Published by Springer Nature in International Journal of Computational Intelligence Systems
The Influence of the Number of Voters on Ranking Data Sampled with the Mallows Model
- 26 August 2026
- Published by Springer Nature in International Journal of Computational Intelligence Systems
Open AccessThe Influence of the Number of Voters on Ranking Data Sampled with the Mallows Model
- 27 July 2026
- Published by Sociedad de Estadística e Investigación Operativa in Boletín de Estadística e Investigación Operativa
- Vol. 2 (42) , 81
Agregación de estructuras aleatorias
Baz, J. (2026). Agregación de estructuras aleatorias. Boletín de Estadística e Investigación Operativa. 42(2), 81–86. https://doi.org/10.63552/beio.2026.42.2.08
- 27 July 2026
- Published by Sociedad de Estadística e Investigación Operativa in Boletín de Estadística e Investigación Operativa
- Vol. 2 (42) , 81
Agregación de estructuras aleatorias
Baz, J. (2026). Agregación de estructuras aleatorias. Boletín de Estadística e Investigación Operativa. 42(2), 81–86. https://doi.org/10.63552/beio.2026.42.2.08
- 15 June 2026
- Published by Springer Nature
- p. 116-130
Aggregation of Random Variables Under Weak Stochastic Orders
- 15 June 2026
- Published by Springer Nature
- p. 116-130
Aggregation of Random Variables Under Weak Stochastic Orders
- Open Access
- 7 March 2026
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 193
Measuring the distance between single random inputs and OWA operators
- 7 March 2026
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 193
Open AccessMeasuring the distance between single random inputs and OWA operators
- 9 July 2025
- Published by Springer Nature
- p. 258-269
Input Importance in Aggregation Theory by Means of Dependence Stochastic Orders
- 9 July 2025
- Published by Springer Nature
- p. 258-269
Input Importance in Aggregation Theory by Means of Dependence Stochastic Orders
- 9 July 2025
- Published by Springer Nature
- p. 245-257
Idempotence and Internality of Aggregations of Random Variables
- 9 July 2025
- Published by Springer Nature
- p. 245-257
Idempotence and Internality of Aggregations of Random Variables
- Open Access
- 26 May 2025
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 44 (6) , 1-23
On the property of reduction of variability for mean functions
Mean functions, formally introduced by Cauchy in 1821, are common tools both in the estimation of location measures of unknown distributions and in the aggregation of given data with the purpose of reducing their variability before application of prediction algorithms. However, apart for few specific cases, for this family of statistics there is a lack of existence of formal proofs confirming the reduction in variability with respect to original data. In this paper we provide several results dealing with this property, providing conditions such that the components of a sample and the corresponding mean function are comparable in the convex stochastic order. These results refer to different families of mean functions, such as Ordered Weighted Averagings (OWA), weighted quasi-arithmetic means and the nullnorms class of operators, which are aggregation functions of interest in the field of fuzzy neural networks and in machine learning algorithms. Additional results dealing with the closure under distortion of the convex stochastic order are provided as well.
- 26 May 2025
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 44 (6) , 1-23
Open AccessOn the property of reduction of variability for mean functions
Mean functions, formally introduced by Cauchy in 1821, are common tools both in the estimation of location measures of unknown distributions and in the aggregation of given data with the purpose of reducing their variability before application of prediction algorithms. However, apart for few specific cases, for this family of statistics there is a lack of existence of formal proofs confirming the reduction in variability with respect to original data. In this paper we provide several results dealing with this property, providing conditions such that the components of a sample and the corresponding mean function are comparable in the convex stochastic order. These results refer to different families of mean functions, such as Ordered Weighted Averagings (OWA), weighted quasi-arithmetic means and the nullnorms class of operators, which are aggregation functions of interest in the field of fuzzy neural networks and in machine learning algorithms. Additional results dealing with the closure under distortion of the convex stochastic order are provided as well.
- Open Access
- 13 May 2025
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 516
Uniform random fuzzy measures
- 13 May 2025
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 516
Open AccessUniform random fuzzy measures
- Open Access
- 5 October 2024
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 43 (8) , 1-24
Efficient random walks for generating random fuzzy measures in Möbius representation in large universe
Random generation of fuzzy measures plays a pivotal role in large-scale decision-making and optimization. Random walks ensure uniform generation and adequate coverage. The Möbius representation of set functions is a valuable tool for establishing the sparse structure of fuzzy measures, with its non-negativity closely linked to monotonicity and convexity/supermodularity checking. We propose three efficient methods for monotonicity verification and convexity/supermodularity verification applicable to random walks in Möbius representations, specifically tailored for universal sets larger than ten inputs and k-order fuzzy measures. We first present the baseline methods by directly inspecting monotonicity and convexity constraints. Building on the observation that the majority of initially generated values exhibit non-negativity, we intentionally track negative Möbius values to enhance the computational performance of these baseline approaches. Further, we introduce the more agile methods that employ insertion and merge sorting techniques for both monotonicity and convexity checks in random walks that involve small perturbations of fuzzy measures. To address sparsity in large-scale scenarios, we focus on two major types of measures: k-additive and k-interactive measures, demonstrating their effectiveness through theoretical analysis and experimental results.
- 5 October 2024
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 43 (8) , 1-24
Open AccessEfficient random walks for generating random fuzzy measures in Möbius representation in large universe
Random generation of fuzzy measures plays a pivotal role in large-scale decision-making and optimization. Random walks ensure uniform generation and adequate coverage. The Möbius representation of set functions is a valuable tool for establishing the sparse structure of fuzzy measures, with its non-negativity closely linked to monotonicity and convexity/supermodularity checking. We propose three efficient methods for monotonicity verification and convexity/supermodularity verification applicable to random walks in Möbius representations, specifically tailored for universal sets larger than ten inputs and k-order fuzzy measures. We first present the baseline methods by directly inspecting monotonicity and convexity constraints. Building on the observation that the majority of initially generated values exhibit non-negativity, we intentionally track negative Möbius values to enhance the computational performance of these baseline approaches. Further, we introduce the more agile methods that employ insertion and merge sorting techniques for both monotonicity and convexity checks in random walks that involve small perturbations of fuzzy measures. To address sparsity in large-scale scenarios, we focus on two major types of measures: k-additive and k-interactive measures, demonstrating their effectiveness through theoretical analysis and experimental results.