Alejandro Piad-Morffis
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Alejandro Piad-Morffis has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Yoan Gutiérrez
Department of Software and Computing Systems, University of Alicante, Carretera de San Vicente del Raspeig, s/n, 03690 San Vicente del Raspeig, Alicante, Spain
5 shared publications - Rafael Muñoz
Language and Information Systems Group, Department of Software and Computing Systems, University of Alicante, 03690 Alicante, Spain
4 shared publications Suilan Estevez-Velarde
3 shared publications- Andrés Montoyo
Department of Software and Computing Systems, University of Alicante, 03690 Alicante, Spain
2 shared publications - Antonio Bolufé-Röhler
University of Prince Edward Island
2 shared publications - James Montgomery
School of Information and Communication Technology, University of Tasmania, Hobart, TAS 7000, Australia
2 shared publications
Latest Publications
- 3 February 2026
- Published by Springer Nature
- p. 125-138
Continual Pretraining of a Small Language Model on Cuban Spanish Corpora
- 3 February 2026
- Published by Springer Nature
- p. 125-138
Continual Pretraining of a Small Language Model on Cuban Spanish Corpora
- 1 April 2021
- Published by Elsevier in Journal of Biomedical Informatics
- Vol. 116, 103716
Automatic extension of corpora from the intelligent ensembling of eHealth knowledge discovery systems outputs
- 1 April 2021
- Published by Elsevier in Journal of Biomedical Informatics
- Vol. 116, 103716
Automatic extension of corpora from the intelligent ensembling of eHealth knowledge discovery systems outputs
- 1 September 2020
- Published by Elsevier in Journal of Biomedical Informatics
- Vol. 109, 103517
A computational ecosystem to support eHealth Knowledge Discovery technologies in Spanish
- 1 September 2020
- Published by Elsevier in Journal of Biomedical Informatics
- Vol. 109, 103517
A computational ecosystem to support eHealth Knowledge Discovery technologies in Spanish
- 12 July 2020
- Published by Springer Nature
- p. 167-180
Analyzing the Interaction of Users with News Articles to Create Personalization Services
- 12 July 2020
- Published by Springer Nature
- p. 167-180
Analyzing the Interaction of Users with News Articles to Create Personalization Services
- Open Access
- 1 January 2020
- Published by Association for Computational Linguistics (ACL)
Knowledge Discovery in COVID-19 Research Literature
Alejandro Piad-Morffis, Suilan Estevez-Velarde, Ernesto Luis Estevanell-Valladares, Yoan Gutiérrez, Andrés Montoyo, Rafael Muñoz, Yudivián Almeida-Cruz. Proceedings of the 1st Workshop on NLP for COVID-19 (Part 2) at EMNLP 2020. 2020.
- 1 January 2020
- Published by Association for Computational Linguistics (ACL)
Open AccessKnowledge Discovery in COVID-19 Research Literature
Alejandro Piad-Morffis, Suilan Estevez-Velarde, Ernesto Luis Estevanell-Valladares, Yoan Gutiérrez, Andrés Montoyo, Rafael Muñoz, Yudivián Almeida-Cruz. Proceedings of the 1st Workshop on NLP for COVID-19 (Part 2) at EMNLP 2020. 2020.
- 22 October 2019
- Published by Assoc. for Computational Linguistics Bulgaria
- p. 276-284
Demo Application for LETO: Learning Engine Through Ontologies
- 22 October 2019
- Published by Assoc. for Computational Linguistics Bulgaria
- p. 276-284
Demo Application for LETO: Learning Engine Through Ontologies
- 1 June 2019
- Published by Elsevier in Journal of Biomedical Informatics
- Vol. 94, 103172
A corpus to support eHealth Knowledge Discovery technologies
- 1 June 2019
- Published by Elsevier in Journal of Biomedical Informatics
- Vol. 94, 103172
A corpus to support eHealth Knowledge Discovery technologies
- 1 May 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1089778X,p. 2097-2104
Evolution strategies with thresheld convergence
When optimizing multi-modal spaces, effective search techniques must carefully balance two conflicting tasks: exploration and exploitation. The first refers to the process of identifying promising areas in the search space. The second refers to the process of actually finding the local optima in these areas. This balance becomes increasingly important in stochastic search, where the only knowledge about a function's landscape relies on the relative comparison of random samples. Thresheld convergence is a technique designed to effectively separate the processes of exploration and exploitation. This paper addresses the design of thresheld convergence in the context of evolution strategies. We analyze the behavior of the standard (μ, λ)-ES on multi-modal landscapes and argue that part of it's shortcomings are due to an ineffective balance between exploration and exploitation. Afterwards we present a design for thresheld convergence tailored to ES, as a simple yet effective mechanism to increase the performance of (μ, λ)-ES on multimodal functions.
- 1 May 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1089778X,p. 2097-2104
Evolution strategies with thresheld convergence
When optimizing multi-modal spaces, effective search techniques must carefully balance two conflicting tasks: exploration and exploitation. The first refers to the process of identifying promising areas in the search space. The second refers to the process of actually finding the local optima in these areas. This balance becomes increasingly important in stochastic search, where the only knowledge about a function's landscape relies on the relative comparison of random samples. Thresheld convergence is a technique designed to effectively separate the processes of exploration and exploitation. This paper addresses the design of thresheld convergence in the context of evolution strategies. We analyze the behavior of the standard (μ, λ)-ES on multi-modal landscapes and argue that part of it's shortcomings are due to an ineffective balance between exploration and exploitation. Afterwards we present a design for thresheld convergence tailored to ES, as a simple yet effective mechanism to increase the performance of (μ, λ)-ES on multimodal functions.
- 1 June 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 11 (1089778X) , 40-47
Differential evolution with thresheld convergence
During the search process of differential evolution (DE), each new solution may represent a new more promising region of the search space (exploration) or a better solution within the current region (exploitation). This concurrent exploitation can interfere with exploration since the identification of a new more promising region depends on finding a (random) solution in that region which is better than its target solution. Ideally, every sampled solution will have the same relative fitness with respect to its nearby local optimum - finding the best region to exploit then becomes the problem of finding the best random solution. However, differential evolution is characterized by an initial period of exploration followed by rapid convergence. Once the population starts converging, the difference vectors become shorter, more exploitation is performed, and an accelerating convergence occurs. This rapid convergence can occur well before the algorithm's budget of function evaluations is exhausted; that is, the algorithm can converge prematurely. In thresheld convergence, early exploitation is “held” back by a threshold function, allowing a longer exploration phase. This paper presents a new adaptive thresheld convergence mechanism which helps DE achieve large performance improvements in multi-modal search spaces.
- 1 June 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 11 (1089778X) , 40-47
Differential evolution with thresheld convergence
During the search process of differential evolution (DE), each new solution may represent a new more promising region of the search space (exploration) or a better solution within the current region (exploitation). This concurrent exploitation can interfere with exploration since the identification of a new more promising region depends on finding a (random) solution in that region which is better than its target solution. Ideally, every sampled solution will have the same relative fitness with respect to its nearby local optimum - finding the best region to exploit then becomes the problem of finding the best random solution. However, differential evolution is characterized by an initial period of exploration followed by rapid convergence. Once the population starts converging, the difference vectors become shorter, more exploitation is performed, and an accelerating convergence occurs. This rapid convergence can occur well before the algorithm's budget of function evaluations is exhausted; that is, the algorithm can converge prematurely. In thresheld convergence, early exploitation is “held” back by a threshold function, allowing a longer exploration phase. This paper presents a new adaptive thresheld convergence mechanism which helps DE achieve large performance improvements in multi-modal search spaces.