Itzel Aranguren
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Itzel Aranguren has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- Diego Oliva
Universidad de Guadalajara, CUCEI
11 shared publications - Arturo Valdivia-G
Universidad de Guadalajara, CUCEI
7 shared publications - Marco Pérez-Cisneros
Universidad de Guadalajara, México
6 shared publications - Angel Casas-Ordaz
Universidad de Guadalajara, CUCEI
3 shared publications - Fernando Fausto
Universidad de Guadalajara, CUCEI
3 shared publications - Javier Galvis-Chacón
Universidad de Guadalajara
3 shared publications
Latest Publications
- Open Access
- 5 November 2026
- Published by Elsevier in Swarm and Evolutionary Computation
- Vol. 111
Connectivity-Aware Diversity Index: A graph-based diversity metric for evolutionary optimization
- 5 November 2026
- Published by Elsevier in Swarm and Evolutionary Computation
- Vol. 111
Open AccessConnectivity-Aware Diversity Index: A graph-based diversity metric for evolutionary optimization
- 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.
- 13 September 2026
- Published by Springer Nature
- p. 1-5
Social Spider Optimization
- 12 August 2026
- Published by Springer Nature
- p. 1-7
Slime Mold Algorithm
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 513-516
Learning Differential Evolution Mutation Strategies via Performance-Driven Large Language Models
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 513-516
Open AccessLearning Differential Evolution Mutation Strategies via Performance-Driven Large Language Models
- 26 June 2026
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 82 (9) , 535
Adaptive metaheuristic design using Savage’s minimum regret criterion: a case study in differential evolution
- 26 June 2026
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 82 (9) , 535
Adaptive metaheuristic design using Savage’s minimum regret criterion: a case study in differential evolution
- Open Access
- 21 June 2026
- Published by Springer Nature in Scientific Reports
- Vol. 16 (1)
Machine and deep learning in facial expression recognition: a survey based on facial action units
Facial Expression Recognition (FER) has become increasingly relevant in engineering applications spanning security, healthcare, human-robot interaction, and intelligent systems. Accurate recognition of emotional states through facial cues is particularly important for enabling autonomous systems to interpret human intent in dynamic environments. This study presents a survey of recent advances in FER, with a focus on machine learning (ML) and deep learning (DL) methodologies developed between 2019 and 2024. Special attention is given to Facial Action Unit Detection (FAUD) as an intermediate and physiologically grounded representation for expression recognition. The analyzed literature is organized according to the final scope of the proposed models, distinguishing FAUD-oriented, FER-oriented, AU-assisted FER, and FAUD-to-FER approaches. Through this structured comparison, the survey identifies methodological trends, reported performance patterns, and the conditions under which FAUD-based intermediate modeling appears particularly advantageous for reliable FER.
- 21 June 2026
- Published by Springer Nature in Scientific Reports
- Vol. 16 (1)
Open AccessMachine and deep learning in facial expression recognition: a survey based on facial action units
Facial Expression Recognition (FER) has become increasingly relevant in engineering applications spanning security, healthcare, human-robot interaction, and intelligent systems. Accurate recognition of emotional states through facial cues is particularly important for enabling autonomous systems to interpret human intent in dynamic environments. This study presents a survey of recent advances in FER, with a focus on machine learning (ML) and deep learning (DL) methodologies developed between 2019 and 2024. Special attention is given to Facial Action Unit Detection (FAUD) as an intermediate and physiologically grounded representation for expression recognition. The analyzed literature is organized according to the final scope of the proposed models, distinguishing FAUD-oriented, FER-oriented, AU-assisted FER, and FAUD-to-FER approaches. Through this structured comparison, the survey identifies methodological trends, reported performance patterns, and the conditions under which FAUD-based intermediate modeling appears particularly advantageous for reliable FER.
- Open Access
Research on the Effect of the Activation Functions in the Hidden Layer and Features in NARX Models to Improve the Photovoltaic Power Generation Forecasting
Photovoltaic power forecasting is important because solar generation varies with weather conditions. Accurate forecasts help improve grid operation, reduce costs, enhance system stability, and support battery management. This paper presents a hybrid methodology that combines statistical analysis and machine learning to forecast photovoltaic power generation. First, the data are cleaned and preprocessed. Then, the input vector is selected using two criteria: collinearity analysis to remove redundant variables, and Granger causality to identify variables with predictive value in a nonlinear autoregressive with exogenous inputs artificial neural network (NARX-ANN) framework. Next, an experimental design is used to evaluate two training algorithms and activation functions for the hidden layer available in Matlab® version 26.1.0.3276743 (R2026a Update 3, MathWorks Inc., Natick, MA, USA). The methodology is validated by comparing hundreds of input-variable combinations generated through binomial coefficients. A case study using data from Sonora, Mexico, shows that the best model is the Collinearity–Causality (CC)-NARX-4 model, which uses four input variables, a radial basis function in the hidden layer, and Bayesian regularization backpropagation. This model achieves a root-mean-square error (RMSE) of approximately 132 watts (W) for the forecasting stage/forecasting horizon. The results are also compared with a nonlinear autoregressive (NAR) model to assess the predictive benefit of including exogenous inputs. The final outcome is a robust methodology for improving multivariable neural networks through (i) optimized input-vector selection using collinearity and causality tests, validated by an exhaustive combinatorial algorithm; and (ii) a systematic procedure for configuring the hidden-layer transfer function and the neural network training function.
Open AccessResearch on the Effect of the Activation Functions in the Hidden Layer and Features in NARX Models to Improve the Photovoltaic Power Generation Forecasting
Photovoltaic power forecasting is important because solar generation varies with weather conditions. Accurate forecasts help improve grid operation, reduce costs, enhance system stability, and support battery management. This paper presents a hybrid methodology that combines statistical analysis and machine learning to forecast photovoltaic power generation. First, the data are cleaned and preprocessed. Then, the input vector is selected using two criteria: collinearity analysis to remove redundant variables, and Granger causality to identify variables with predictive value in a nonlinear autoregressive with exogenous inputs artificial neural network (NARX-ANN) framework. Next, an experimental design is used to evaluate two training algorithms and activation functions for the hidden layer available in Matlab® version 26.1.0.3276743 (R2026a Update 3, MathWorks Inc., Natick, MA, USA). The methodology is validated by comparing hundreds of input-variable combinations generated through binomial coefficients. A case study using data from Sonora, Mexico, shows that the best model is the Collinearity–Causality (CC)-NARX-4 model, which uses four input variables, a radial basis function in the hidden layer, and Bayesian regularization backpropagation. This model achieves a root-mean-square error (RMSE) of approximately 132 watts (W) for the forecasting stage/forecasting horizon. The results are also compared with a nonlinear autoregressive (NAR) model to assess the predictive benefit of including exogenous inputs. The final outcome is a robust methodology for improving multivariable neural networks through (i) optimized input-vector selection using collinearity and causality tests, validated by an exhaustive combinatorial algorithm; and (ii) a systematic procedure for configuring the hidden-layer transfer function and the neural network training function.
- 29 April 2026
- Published by Springer Nature
- p. 103-117
Prompting Evolution: Leveraging LLMs for Automated Mutation Strategy Design in Differential Evolution
- 29 April 2026
- Published by Springer Nature
- p. 103-117
Prompting Evolution: Leveraging LLMs for Automated Mutation Strategy Design in Differential Evolution
- 8 April 2026
- Published by Springer Nature
- p. 1-5
Fireworks Algorithm