Angel Casas-Ordaz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Angel Casas-Ordaz has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
- Diego Oliva
Universidad de Guadalajara, CUCEI
17 shared publications - Jorge Ramos-Frutos
Centro de Innovación Aplicada en Tecnologías Competitivas
10 shared publications - Marco Pérez-Cisneros
Universidad de Guadalajara, México
8 shared publications - Israel Miguel-Andrés
CIATEC
6 shared publications - Mario A. Navarro
Universidad de Guadalajara, CUCEI
6 shared publications - Eduardo H. Haro
Depto. de Ingeniería Electro-Fotónica, Universidad de Guadalajara, CUCEI, Guadalajara, Mexico
5 shared publications
Latest Publications
- 5 November 2026
- Published by Springer Nature
- p. 613-629
A Comparative Study of Wrapper-Based Feature Selection for Machine Learning-Based Bearing Fault Diagnosis
- 5 November 2026
- Published by Springer Nature
- p. 613-629
A Comparative Study of Wrapper-Based Feature Selection for Machine Learning-Based Bearing Fault Diagnosis
- Open Access
- 20 September 2026
- Published by MDPI AG in Machine Learning and Knowledge Extraction
- Vol. 8 (9) , 291
An Improved Differential Evolution Algorithm Using Mahalanobis Distance and Cholesky Decomposition for Wrapper-Based Feature Selection
In machine learning, feature selection is a fundamental component that plays a crucial role in improving prediction accuracy and reducing the computational time of classification models. Feature selection involves eliminating irrelevant or redundant features that can negatively affect model learning. This article proposes a wrapper-based method that uses a binary evolutionary algorithm for feature selection. The Differential Evolution algorithm performs feature selection and is combined with Mahalanobis distance and Cholesky decomposition (MaCRO-DE). Using Cholesky decomposition to calculate Mahalanobis distance helps to determine the proximity of feature subsets, which is useful for deciding which features to select or discard. Subsequently, two classifiers (K-nearest neighbors and the support vector machine) are used as evaluators, along with a V-shaped transfer function, to identify the most suitable option for the proposed method. To evaluate the effectiveness of the proposed methodology, the CEC-2017 benchmark and twelve widely used datasets from the UCI repository are employed. Experimental tests are conducted using thirteen prominent metaheuristic algorithms. The results indicate that the proposal effectively achieves its objectives, outperforming the benchmark across the performance indicators used for comparison, including Accuracy, F1-Score, Recall, Precision, Fitness value, and number of selected features.
- 20 September 2026
- Published by MDPI AG in Machine Learning and Knowledge Extraction
- Vol. 8 (9) , 291
Open AccessAn Improved Differential Evolution Algorithm Using Mahalanobis Distance and Cholesky Decomposition for Wrapper-Based Feature Selection
In machine learning, feature selection is a fundamental component that plays a crucial role in improving prediction accuracy and reducing the computational time of classification models. Feature selection involves eliminating irrelevant or redundant features that can negatively affect model learning. This article proposes a wrapper-based method that uses a binary evolutionary algorithm for feature selection. The Differential Evolution algorithm performs feature selection and is combined with Mahalanobis distance and Cholesky decomposition (MaCRO-DE). Using Cholesky decomposition to calculate Mahalanobis distance helps to determine the proximity of feature subsets, which is useful for deciding which features to select or discard. Subsequently, two classifiers (K-nearest neighbors and the support vector machine) are used as evaluators, along with a V-shaped transfer function, to identify the most suitable option for the proposed method. To evaluate the effectiveness of the proposed methodology, the CEC-2017 benchmark and twelve widely used datasets from the UCI repository are employed. Experimental tests are conducted using thirteen prominent metaheuristic algorithms. The results indicate that the proposal effectively achieves its objectives, outperforming the benchmark across the performance indicators used for comparison, including Accuracy, F1-Score, Recall, Precision, Fitness value, and number of selected features.
- 8 September 2026
- Published by Springer Nature
- p. 1-3
K-Means Whale Optimization Algorithm
- 20 December 2025
- Published by Institute of Central Computation and Knowledge Inc. in ICCK Transactions on Swarm and Evolutionary Learning
- Vol. 1 (2) , 83-93
A Comparison of Evolutionary Computation Techniques for Parameter Estimation of Chaotic Systems
In recent years, Parameter Estimation (PE) has become a topic of growing interest due to its broad applications in science and engineering. An important application is the identification of Chaotic Systems (CS), which enables synchronization and control of chaotic behavior. However, the parameter estimation of CS is a highly nonlinear and multidimensional optimization problem where traditional approaches are often unsuitable. To overcome these limitations, Evolutionary Computation Techniques (ECT) have been widely adopted to tackle complex nonlinear optimization tasks. Recently, classical and modern ECT methods have been proposed for estimating the parameters of chaotic systems. However, most reported studies rely exclusively on cost function values, overlooking the quality and consistency of the solutions obtained. This paper presents a comparative study of representative evolutionary techniques for estimating the parameters of chaotic systems. The study assesses the performance of the techniques and the homogeneity of the solutions through statistical analysis. Experimental results on the Lorenz and Chen systems are examined and validated using nonparametric tests.
- 20 December 2025
- Published by Institute of Central Computation and Knowledge Inc. in ICCK Transactions on Swarm and Evolutionary Learning
- Vol. 1 (2) , 83-93
A Comparison of Evolutionary Computation Techniques for Parameter Estimation of Chaotic Systems
In recent years, Parameter Estimation (PE) has become a topic of growing interest due to its broad applications in science and engineering. An important application is the identification of Chaotic Systems (CS), which enables synchronization and control of chaotic behavior. However, the parameter estimation of CS is a highly nonlinear and multidimensional optimization problem where traditional approaches are often unsuitable. To overcome these limitations, Evolutionary Computation Techniques (ECT) have been widely adopted to tackle complex nonlinear optimization tasks. Recently, classical and modern ECT methods have been proposed for estimating the parameters of chaotic systems. However, most reported studies rely exclusively on cost function values, overlooking the quality and consistency of the solutions obtained. This paper presents a comparative study of representative evolutionary techniques for estimating the parameters of chaotic systems. The study assesses the performance of the techniques and the homogeneity of the solutions through statistical analysis. Experimental results on the Lorenz and Chen systems are examined and validated using nonparametric tests.
- Open Access
- 20 November 2025
- Published by Institute of Central Computation and Knowledge Inc. in ICCK Transactions on Swarm and Evolutionary Learning
- Vol. 1 (2) , 50-82
A Comparative Analysis of Recent Metaheuristic Algorithms for Image Segmentation Using the Minimum Cross-Entropy for Multilevel Thresholding
Metaheuristic Algorithms (MAs) are commonly used in the scope of digital image processing, in particular, image segmentation processes. This is evident in Multilevel Thresholding (MTH) methods, where the optimal threshold configuration must be found to produce high-quality segmented images. Minimum Cross-Entropy (MCE) is one of the most prominent techniques for MTH due to its simplicity and efficiency. This article proposes a comparison of recent MAs that have not yet been implemented for image segmentation. Six recently published MAs were implemented and tested on nine complicated images selected from the BSDS300 dataset. Analyzing the results reveals the best algorithm when MCE is used as the objective function. Central tendency indicators, such as Standard Deviation and mean, are also used to analyze the five threshold values. Additionally, three quality indicators used in processing images are analyzed: Peak Signal-to-Noise Ratio (PSNR), Structural Similarity (SSIM), and Feature Similarity (FSIM). The result of this analysis allows for the quality of the segmentation of each algorithm used in the comparison. The metrics with the highest values are indicative of the most effective algorithm in terms of segmentation performance.
- 20 November 2025
- Published by Institute of Central Computation and Knowledge Inc. in ICCK Transactions on Swarm and Evolutionary Learning
- Vol. 1 (2) , 50-82
Open AccessA Comparative Analysis of Recent Metaheuristic Algorithms for Image Segmentation Using the Minimum Cross-Entropy for Multilevel Thresholding
Metaheuristic Algorithms (MAs) are commonly used in the scope of digital image processing, in particular, image segmentation processes. This is evident in Multilevel Thresholding (MTH) methods, where the optimal threshold configuration must be found to produce high-quality segmented images. Minimum Cross-Entropy (MCE) is one of the most prominent techniques for MTH due to its simplicity and efficiency. This article proposes a comparison of recent MAs that have not yet been implemented for image segmentation. Six recently published MAs were implemented and tested on nine complicated images selected from the BSDS300 dataset. Analyzing the results reveals the best algorithm when MCE is used as the objective function. Central tendency indicators, such as Standard Deviation and mean, are also used to analyze the five threshold values. Additionally, three quality indicators used in processing images are analyzed: Peak Signal-to-Noise Ratio (PSNR), Structural Similarity (SSIM), and Feature Similarity (FSIM). The result of this analysis allows for the quality of the segmentation of each algorithm used in the comparison. The metrics with the highest values are indicative of the most effective algorithm in terms of segmentation performance.
- 5 August 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 297
Improving the response surface methodology optimization with metaheuristics: A practical approach
- 5 August 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 297
Improving the response surface methodology optimization with metaheuristics: A practical approach
- Open Access
- 31 May 2025
- Published by Institute of Central Computation and Knowledge Inc. in ICCK Transactions on Swarm and Evolutionary Learning
- Vol. 1 (1) , 12-24
Enhanced Differential Evolution: Multi-Strategy Approach with Neighborhood-Based Selection
The Differential Evolution (DE) has stood as a cornerstone of Evolutionary Computation (EC), inspiring numerous approaches. Despite its foundational role, the selection stage of DE has received little attention, with only 2% of documented modifications in the literature on this aspect. Recent research has underscored the potential for significant algorithmic improvement through thoughtful modifications to this critical stage, particularly in accelerating the exploitation phase. This study introduces a novel EC strategy rooted in DE principles. To enhance algorithmic exploration, a systematic decision-making process regarding function evaluations is employed to select between two of the most prevalent mutations in the field. Similarly, a new selection operator is introduced to augment the exploitation phase by comparing each individual with its respective 25% neighborhood population. The proposed algorithm, Differential Evolution with Selection by Neighborhood (DESN), undergoes comprehensive evaluation against eight classical and recent approaches, leveraging the CEC-2017 set of benchmark functions.
- 31 May 2025
- Published by Institute of Central Computation and Knowledge Inc. in ICCK Transactions on Swarm and Evolutionary Learning
- Vol. 1 (1) , 12-24
Open AccessEnhanced Differential Evolution: Multi-Strategy Approach with Neighborhood-Based Selection
The Differential Evolution (DE) has stood as a cornerstone of Evolutionary Computation (EC), inspiring numerous approaches. Despite its foundational role, the selection stage of DE has received little attention, with only 2% of documented modifications in the literature on this aspect. Recent research has underscored the potential for significant algorithmic improvement through thoughtful modifications to this critical stage, particularly in accelerating the exploitation phase. This study introduces a novel EC strategy rooted in DE principles. To enhance algorithmic exploration, a systematic decision-making process regarding function evaluations is employed to select between two of the most prevalent mutations in the field. Similarly, a new selection operator is introduced to augment the exploitation phase by comparing each individual with its respective 25% neighborhood population. The proposed algorithm, Differential Evolution with Selection by Neighborhood (DESN), undergoes comprehensive evaluation against eight classical and recent approaches, leveraging the CEC-2017 set of benchmark functions.
- 5 May 2025
- Published by Elsevier in Neurocomputing
- Vol. 641
Multi-population estimation of distribution algorithm for multilevel thresholding in image segmentation
- 5 May 2025
- Published by Elsevier in Neurocomputing
- Vol. 641
Multi-population estimation of distribution algorithm for multilevel thresholding in image segmentation
- 25 April 2025
- Published by Springer Nature
- p. 103-134
Diversity Measurement in Different PSO Variants Applied to Global Optimization and Classical Engineering Problems
- 25 April 2025
- Published by Springer Nature
- p. 103-134
Diversity Measurement in Different PSO Variants Applied to Global Optimization and Classical Engineering Problems