Domingo López-Rodríguez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Domingo López-Rodríguez has a total of 53 co-authors. Here are the top co-authors by number of shared publications:
- Enrique Mérida-Casermeiro
University of Malaga
14 shared publications - Ezequiel López-Rubio
University of Malaga
9 shared publications - Gloria Galán-Marín
Department of Mechanical, Energetic and Materials Engineering, University of Extremadura, Avda. de Elvas s/n; 06006 Badajoz, Spain
8 shared publications - Manuel Ojeda-Hernández
Umeå University
8 shared publications Juan M. Ortiz-De-Lazcano-Lobato
University of Malaga
6 shared publicationsJuan Miguel Ortiz-De-Lazcano-Lobato
Dept. of Comput. Languages & Comput. Sci., Univ. of Malaga, Malaga, Spain
6 shared publications
Latest Publications
- Open Access
- 12 June 2026
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 45 (10)
Direct-optimal systems of attribute implications in fuzzy formal concept analysis
Efficient closure computation is a key challenge in fuzzy Formal Concept Analysis. Direct implicational systems, which allow for one-step closure calculation, offer a powerful solution, but their formalization and practical computation in the fuzzy setting have remained largely open problems. This paper provides a comprehensive contribution to fill this gap. We first extend the concept of a direct system to fuzzy attribute implications and establish a complete theoretical characterization via a novel Fuzzy Exchange Condition. Building on this, we define the notion of a direct-optimal system and develop the algorithm, a provably correct, interleaved strategy for its computation. A rigorous experimental evaluation demonstrates that our proposed algorithm is orders of magnitude more efficient than naive sequential approaches, and we diagnose the distinct computational bottlenecks that cause these simpler methods to fail. This work thus delivers a complete and empirically validated pipeline, from theory to practice, for the efficient computation of direct-optimal bases.
- 12 June 2026
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 45 (10)
Open AccessDirect-optimal systems of attribute implications in fuzzy formal concept analysis
Efficient closure computation is a key challenge in fuzzy Formal Concept Analysis. Direct implicational systems, which allow for one-step closure calculation, offer a powerful solution, but their formalization and practical computation in the fuzzy setting have remained largely open problems. This paper provides a comprehensive contribution to fill this gap. We first extend the concept of a direct system to fuzzy attribute implications and establish a complete theoretical characterization via a novel Fuzzy Exchange Condition. Building on this, we define the notion of a direct-optimal system and develop the algorithm, a provably correct, interleaved strategy for its computation. A rigorous experimental evaluation demonstrates that our proposed algorithm is orders of magnitude more efficient than naive sequential approaches, and we diagnose the distinct computational bottlenecks that cause these simpler methods to fail. This work thus delivers a complete and empirically validated pipeline, from theory to practice, for the efficient computation of direct-optimal bases.
- Open Access
- 16 March 2026
- Published by Elsevier in SSRN Electronic Journal
An FCA-based framework for generating Interpretable and User-elicited Fuzzy RDF Properties using bonds
Knowledge Graph Completion (KGC) is critical for modern Artificial Intelligence, yet dominant embedding-based methods operate as {\em black boxes}, lacking the interpretability required for high-stakes applications. This paper introduces a novel, formally-grounded framework for interpretable link generation where users can direct the inference process. We leverage intercontextual bonds from Fuzzy Formal Concept Analysis (FFCA) to synthesize new fuzzy Resource Description Framework (RDF) properties by composing evidence from different contexts, guided by explicit domain knowledge. Our framework provides a choice between complementary inference strategies: a benevolent bond for optimistic evidence aggregation and two distinct rigorous bonds for pessimistic, high-certainty validation. We establish the formal soundness of our approach with key theoretical results, including duality theorems and a proof that our rigorous constructions are the greatest solutions to specific systems of fuzzy relational equations. This provides a robust computational model and guarantees full traceability for every inferred link. Through detailed case studies, we demonstrate the framework's superior interpretability and its capacity for auditable, user-guided knowledge generation, offering a transparent alternative to opaque KGC models.
- 16 March 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessAn FCA-based framework for generating Interpretable and User-elicited Fuzzy RDF Properties using bonds
Knowledge Graph Completion (KGC) is critical for modern Artificial Intelligence, yet dominant embedding-based methods operate as {\em black boxes}, lacking the interpretability required for high-stakes applications. This paper introduces a novel, formally-grounded framework for interpretable link generation where users can direct the inference process. We leverage intercontextual bonds from Fuzzy Formal Concept Analysis (FFCA) to synthesize new fuzzy Resource Description Framework (RDF) properties by composing evidence from different contexts, guided by explicit domain knowledge. Our framework provides a choice between complementary inference strategies: a benevolent bond for optimistic evidence aggregation and two distinct rigorous bonds for pessimistic, high-certainty validation. We establish the formal soundness of our approach with key theoretical results, including duality theorems and a proof that our rigorous constructions are the greatest solutions to specific systems of fuzzy relational equations. This provides a robust computational model and guarantees full traceability for every inferred link. Through detailed case studies, we demonstrate the framework's superior interpretability and its capacity for auditable, user-guided knowledge generation, offering a transparent alternative to opaque KGC models.
- 25 November 2025
- Published by Springer Nature
- p. 189-195
Inheritance of Completeness Between Systems of Strong and Weak Implications
- 25 November 2025
- Published by Springer Nature
- p. 189-195
Inheritance of Completeness Between Systems of Strong and Weak Implications
- Open Access
- 1 September 2025
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 520
Close-by-One-like algorithms in the fuzzy setting: Theory and experimentation
- 1 September 2025
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 520
Open AccessClose-by-One-like algorithms in the fuzzy setting: Theory and experimentation
- 11 July 2025
- Published by Springer Nature
- p. 146-157
On Direct Systems of Implications with Graded Attributes
- 11 July 2025
- Published by Springer Nature
- p. 146-157
On Direct Systems of Implications with Graded Attributes
- Open Access
- 11 February 2025
- Published by Elsevier in Environmental Modelling & Software
- Vol. 186
URSUS_LST: URban SUStainability intelligent system for predicting the impact of urban green infrastructure on land surface temperatures
- 11 February 2025
- Published by Elsevier in Environmental Modelling & Software
- Vol. 186
Open AccessURSUS_LST: URban SUStainability intelligent system for predicting the impact of urban green infrastructure on land surface temperatures
- Open Access
- 18 January 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (2) , 309
New Simplification Rules for Databases with Positive and Negative Attributes
In this paper, new logical equivalences are presented within the simplification logic with mixed attributes paradigm, which allow the obtention of bases of shorter, easier-to-read attribute implications. In addition to the theoretical results which show that the proposed equivalences indeed hold in simplification logic with mixed attributes, experimental results which showcase the effectiveness of this method are also provided. Furthermore, the simplification method presented is iterative and gives sufficiently good results in only one or two iterations, therefore presenting itself as a reasonable procedure in time-sensitive experiments.
- 18 January 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (2) , 309
Open AccessNew Simplification Rules for Databases with Positive and Negative Attributes
In this paper, new logical equivalences are presented within the simplification logic with mixed attributes paradigm, which allow the obtention of bases of shorter, easier-to-read attribute implications. In addition to the theoretical results which show that the proposed equivalences indeed hold in simplification logic with mixed attributes, experimental results which showcase the effectiveness of this method are also provided. Furthermore, the simplification method presented is iterative and gives sufficiently good results in only one or two iterations, therefore presenting itself as a reasonable procedure in time-sensitive experiments.
- 1 August 2024
- Published by Springer Nature
- p. 113-122
Rearrangement of Fuzzy Formal Contexts for Reducing Cost of Algorithms
- 1 August 2024
- Published by Springer Nature
- p. 113-122
Rearrangement of Fuzzy Formal Contexts for Reducing Cost of Algorithms
- Open Access
- 5 February 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (3) , 498
Analysis of Fuzzy Vector Spaces as an Algebraic Framework for Flag Codes
Flag codes are a recent network coding strategy based on linear algebra. Fuzzy vector subspaces extend the notions of classical linear algebra. They can be seen as abstractions of flags to the point that several fuzzy vector subspaces can be identified to the same flag, which naturally induces an equivalence relation on the set of fuzzy vector subspaces. The main contributions of this work are the methodological abstraction of flags and flag codes in terms of fuzzy vector subspaces, as well as the generalisation of three distinct equivalence relations that originated from the fuzzy subgroup theory and study of their connection with flag codes, computing the number of equivalence classes in the discrete case, which represent the number of essentially distinct flags, and a comprehensive analysis of such relations and the properties of the corresponding quotient sets.
- 5 February 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (3) , 498
Open AccessAnalysis of Fuzzy Vector Spaces as an Algebraic Framework for Flag Codes
Flag codes are a recent network coding strategy based on linear algebra. Fuzzy vector subspaces extend the notions of classical linear algebra. They can be seen as abstractions of flags to the point that several fuzzy vector subspaces can be identified to the same flag, which naturally induces an equivalence relation on the set of fuzzy vector subspaces. The main contributions of this work are the methodological abstraction of flags and flag codes in terms of fuzzy vector subspaces, as well as the generalisation of three distinct equivalence relations that originated from the fuzzy subgroup theory and study of their connection with flag codes, computing the number of equivalence classes in the discrete case, which represent the number of essentially distinct flags, and a comprehensive analysis of such relations and the properties of the corresponding quotient sets.
- Open Access
Regression of the Rician Noise Level in 3D Magnetic Resonance Images from the Distribution of the First Significant Digit
This paper investigates the distribution characteristics of Fourier, discrete cosine, and discrete sine transform coefficients in T1 MRI images. This paper reveals their adherence to Benford’s law, characterized by a logarithmic distribution of first digits. The impact of Rician noise on the first digit distribution is examined, which causes deviations from the ideal distribution. A novel methodology is proposed for noise level estimation, employing metrics such as the Bhattacharyya distance, Kullback–Leibler divergence, total variation distance, Hellinger distance, and Jensen–Shannon divergence. Supervised learning techniques utilize these metrics as regressors. Evaluations on MRI scans from several datasets coming from a wide range of different acquisition devices of 1.5 T and 3 T, comprising hundreds of patients, validate the adherence of noiseless T1 MRI frequency domain coefficients to Benford’s law. Through rigorous experimentation, our methodology has demonstrated competitiveness with established noise estimation techniques, even surpassing them in numerous conducted experiments. This research empirically supports the application of Benford’s law in transforms, offering a reliable approach for noise estimation in denoising algorithms and advancing image quality assessment.
Open AccessRegression of the Rician Noise Level in 3D Magnetic Resonance Images from the Distribution of the First Significant Digit
This paper investigates the distribution characteristics of Fourier, discrete cosine, and discrete sine transform coefficients in T1 MRI images. This paper reveals their adherence to Benford’s law, characterized by a logarithmic distribution of first digits. The impact of Rician noise on the first digit distribution is examined, which causes deviations from the ideal distribution. A novel methodology is proposed for noise level estimation, employing metrics such as the Bhattacharyya distance, Kullback–Leibler divergence, total variation distance, Hellinger distance, and Jensen–Shannon divergence. Supervised learning techniques utilize these metrics as regressors. Evaluations on MRI scans from several datasets coming from a wide range of different acquisition devices of 1.5 T and 3 T, comprising hundreds of patients, validate the adherence of noiseless T1 MRI frequency domain coefficients to Benford’s law. Through rigorous experimentation, our methodology has demonstrated competitiveness with established noise estimation techniques, even surpassing them in numerous conducted experiments. This research empirically supports the application of Benford’s law in transforms, offering a reliable approach for noise estimation in denoising algorithms and advancing image quality assessment.