Danny Múnera
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Danny Múnera has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Diana Patricia Tobón
Universidad de Antioquía
3 shared publications - Martha Lucía Rodríguez-López
Universidade Estadual de Maringá
2 shared publications - Natalia Gaviria
Universidad de Antioquía
2 shared publications - Andrés Felipe Parra Barragán
Applied Telecommunications Research Group (GITA), Faculty of Engineering, University of Antioquia, Medellín 050010, Colombia
1 shared publication - Daniel Diaz
University of Paris 1-Sorbonne France
1 shared publication Diana P. Tobón
1 shared publication
Latest Publications
- Open Access
- 11 July 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (14) , 6963
Reconstructing High-End Soil Sensor Measurements from a Low-Cost 7-in-1 Device in Hass Avocado Orchards Using Random Forest
Soil monitoring is a key component of precision agriculture and environmental sensing systems, where reliable measurements support irrigation management and crop monitoring. Although high-end sensing platforms provide accurate measurements, their cost limits widespread adoption, particularly in resource-constrained agricultural environments. Low-cost soil sensors, such as widely available 7-in-1 probes capable of measuring soil moisture, temperature, electrical conductivity, and pH, offer a scalable alternative for distributed monitoring; however, their limited accuracy raises concerns regarding their reliability for decision-support systems. This study investigates whether measurements from a single low-cost 7-in-1 soil sensor contain sufficient information to reconstruct the outputs of a commercial high-end sensing platform (CropX), specifically volumetric water content (VWC) and pore-water electrical conductivity (ECpw). Field data were collected in a tropical Hass avocado orchard in Colombia, and four machine learning models were evaluated to reconstruct CropX measurements from low-cost sensor signals at three soil depths (20, 41, and 66 cm). Random Forest achieved the highest reconstruction performance, with coefficient of determination R2 values between 0.9965 and 0.9986 and consistently low root mean square error (RMSE) and mean absolute error (MAE) across depths. Out-of-bag validation and multi-seed stability analyses confirmed the robustness of the models despite the limited dataset size. A chronological validation (80–20%) showed substantially reduced performance, indicating that the proposed approach is more suitable for reconstructing high-end sensor signals under concurrent measurement conditions than for strict temporal extrapolation. Therefore, the framework should be interpreted as a virtual sensing strategy for reconstructing simultaneous CropX measurements from low-cost sensor observations rather than as a standalone model for predicting future soil conditions without periodic recalibration. These results demonstrate that low-cost multi-parameter sensors can support high-fidelity virtual reconstruction of high-end soil measurements, contributing to the development of scalable and cost-effective soil monitoring systems for precision agriculture.
- 11 July 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (14) , 6963
Open AccessReconstructing High-End Soil Sensor Measurements from a Low-Cost 7-in-1 Device in Hass Avocado Orchards Using Random Forest
Soil monitoring is a key component of precision agriculture and environmental sensing systems, where reliable measurements support irrigation management and crop monitoring. Although high-end sensing platforms provide accurate measurements, their cost limits widespread adoption, particularly in resource-constrained agricultural environments. Low-cost soil sensors, such as widely available 7-in-1 probes capable of measuring soil moisture, temperature, electrical conductivity, and pH, offer a scalable alternative for distributed monitoring; however, their limited accuracy raises concerns regarding their reliability for decision-support systems. This study investigates whether measurements from a single low-cost 7-in-1 soil sensor contain sufficient information to reconstruct the outputs of a commercial high-end sensing platform (CropX), specifically volumetric water content (VWC) and pore-water electrical conductivity (ECpw). Field data were collected in a tropical Hass avocado orchard in Colombia, and four machine learning models were evaluated to reconstruct CropX measurements from low-cost sensor signals at three soil depths (20, 41, and 66 cm). Random Forest achieved the highest reconstruction performance, with coefficient of determination R2 values between 0.9965 and 0.9986 and consistently low root mean square error (RMSE) and mean absolute error (MAE) across depths. Out-of-bag validation and multi-seed stability analyses confirmed the robustness of the models despite the limited dataset size. A chronological validation (80–20%) showed substantially reduced performance, indicating that the proposed approach is more suitable for reconstructing high-end sensor signals under concurrent measurement conditions than for strict temporal extrapolation. Therefore, the framework should be interpreted as a virtual sensing strategy for reconstructing simultaneous CropX measurements from low-cost sensor observations rather than as a standalone model for predicting future soil conditions without periodic recalibration. These results demonstrate that low-cost multi-parameter sensors can support high-fidelity virtual reconstruction of high-end soil measurements, contributing to the development of scalable and cost-effective soil monitoring systems for precision agriculture.
- 1 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Solving Hard Combinatorial Optimization Problems using Cooperative Parallel Metaheuristics
Utilisation de méta-heuristiques coopératives parallèles pour la résolution de problèmes d'optimisation combinatoire difficiles: Les Problèmes d’Optimisation Combinatoire (COP) sont largement utilisés pour modéliser et résoudre un grand nombre de problèmes industriels. La résolution de ces problèmes pose un véritable défi en raison de leur inhérente difficulté, la plupart étant NP-difficiles. En effet, les COP sont difficiles à résoudre par des méthodes exactes car la taille de l’espace de recherche à explorer croît de manière exponentielle par rapport à la taille du problème. Les méta-heuristiques sont souvent les méthodes les plus efficaces pour résoudre les problèmes les plus difficiles. Malheureusement, bien des problèmes réels restent hors de portée des meilleures méta-heuristiques. Le parallélisme permet d’améliorer les performances des méta-heuristiques. L’idée de base est d’avoir plusieurs instances d’une méta-heuristique explorant de manière simultanée l’espace de recherche pour accélérer la recherche de solution. Les meilleures techniques font communiquer ces instances pour augmenter la probabilité de trouver une solution. Cependant, la conception d’une méthode parallèle coopérative n’est pas une tâche aisée, et beaucoup de choix cruciaux concernant la communication doivent être résolus. Malheureusement, nous savons qu’il n’existe pas d’unique configuration permettant de résoudre efficacement tous les problèmes. Ceci explique que l’on trouve aujourd’hui des systèmes coopératifs efficaces mais conçus pour un problème spécifique ou bien des systèmes plus génériques mais dont les performances sont en général limitées. Dans cette thèse nous proposons un cadre général pour les méta-heuristiques parallèles coopératives (CPMH). Ce cadre prévoit plusieurs paramètres permettant de contrôler la coopération. CPMH organise les instances de méta-heuristiques en équipes ; chaque équipe vise à intensifier la recherche dans une région particulière de l’espace de recherche. Cela se fait grâce à des communications intra-équipes. Des communications inter-équipes permettent quant a` elles d’assurer la diversification de la recherche. CPMH offre à l’utilisateur la possibilité d’ajuster le compromis entre intensification et diversification. De plus, ce cadre supporte différentes méta-heuristiques et permet aussi l’hybridation de méta-heuristiques. Nous proposons également X10CPMH, une implémentation de CPMH, écrite en langage parallèle X10. Pour valider notre approche, nous abordons deux COP du monde industriel : des variantes difficiles du Problème de Stable Matching (SMP) et le Problème d’Affectation Quadratique (QAP). Nous proposons plusieurs méta-heuristiques originales en version séquentielle et parallèle, y compris un nouvelle méthode basée sur l’optimisation extrémale ainsi qu’un nouvel algorithme hybride en parallèle coopératif pour QAP. Ces algorithmes sont implémentés grâce à X10CPMH. L’évaluation expérimentale montre que les versions avec parallélisme coopératif offrent un très bon passage à l’échelle tout en fournissant des solutions de haute qualité. Sur les variantes difficiles de SMP, notre méthode coopérative offre des facteurs d’accélération super-linéaires. En ce qui concerne QAP, notre méthode hybride en parallèle coopératif fonctionne très bien sur les cas les plus difficiles et permet d’améliorer les meilleures solutions connues de plusieurs instances.
- 1 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Solving Hard Combinatorial Optimization Problems using Cooperative Parallel Metaheuristics
Utilisation de méta-heuristiques coopératives parallèles pour la résolution de problèmes d'optimisation combinatoire difficiles: Les Problèmes d’Optimisation Combinatoire (COP) sont largement utilisés pour modéliser et résoudre un grand nombre de problèmes industriels. La résolution de ces problèmes pose un véritable défi en raison de leur inhérente difficulté, la plupart étant NP-difficiles. En effet, les COP sont difficiles à résoudre par des méthodes exactes car la taille de l’espace de recherche à explorer croît de manière exponentielle par rapport à la taille du problème. Les méta-heuristiques sont souvent les méthodes les plus efficaces pour résoudre les problèmes les plus difficiles. Malheureusement, bien des problèmes réels restent hors de portée des meilleures méta-heuristiques. Le parallélisme permet d’améliorer les performances des méta-heuristiques. L’idée de base est d’avoir plusieurs instances d’une méta-heuristique explorant de manière simultanée l’espace de recherche pour accélérer la recherche de solution. Les meilleures techniques font communiquer ces instances pour augmenter la probabilité de trouver une solution. Cependant, la conception d’une méthode parallèle coopérative n’est pas une tâche aisée, et beaucoup de choix cruciaux concernant la communication doivent être résolus. Malheureusement, nous savons qu’il n’existe pas d’unique configuration permettant de résoudre efficacement tous les problèmes. Ceci explique que l’on trouve aujourd’hui des systèmes coopératifs efficaces mais conçus pour un problème spécifique ou bien des systèmes plus génériques mais dont les performances sont en général limitées. Dans cette thèse nous proposons un cadre général pour les méta-heuristiques parallèles coopératives (CPMH). Ce cadre prévoit plusieurs paramètres permettant de contrôler la coopération. CPMH organise les instances de méta-heuristiques en équipes ; chaque équipe vise à intensifier la recherche dans une région particulière de l’espace de recherche. Cela se fait grâce à des communications intra-équipes. Des communications inter-équipes permettent quant a` elles d’assurer la diversification de la recherche. CPMH offre à l’utilisateur la possibilité d’ajuster le compromis entre intensification et diversification. De plus, ce cadre supporte différentes méta-heuristiques et permet aussi l’hybridation de méta-heuristiques. Nous proposons également X10CPMH, une implémentation de CPMH, écrite en langage parallèle X10. Pour valider notre approche, nous abordons deux COP du monde industriel : des variantes difficiles du Problème de Stable Matching (SMP) et le Problème d’Affectation Quadratique (QAP). Nous proposons plusieurs méta-heuristiques originales en version séquentielle et parallèle, y compris un nouvelle méthode basée sur l’optimisation extrémale ainsi qu’un nouvel algorithme hybride en parallèle coopératif pour QAP. Ces algorithmes sont implémentés grâce à X10CPMH. L’évaluation expérimentale montre que les versions avec parallélisme coopératif offrent un très bon passage à l’échelle tout en fournissant des solutions de haute qualité. Sur les variantes difficiles de SMP, notre méthode coopérative offre des facteurs d’accélération super-linéaires. En ce qui concerne QAP, notre méthode hybride en parallèle coopératif fonctionne très bien sur les cas les plus difficiles et permet d’améliorer les meilleures solutions connues de plusieurs instances.
- 1 January 2025
- Published by Universidad de Antioquia in Revista Facultad de Ingeniería Universidad de Antioquia
Anomaly classification in IIoT edge devices
An early Industrial Internet of Things (IIoT) Anomaly Detection reduces maintenance costs, minimizes machine downtime, increases safety, and improves product quality. A multi-class classifier that detects events, failures, or attacks is much more efficient than a simple binary classifier, as it relieves a human operator of the task of identifying anomaly causes, thereby avoiding wasted time that could compromise process performance and security. With these issues in mind, this paper aims to determine whether it can differentiate between a failure that generates a temperature increase in an IIoT device processor, a denial-of-service attack on an MQTT broker, and an event caused by an application executing on the IIoT edge device. Data used to perform the classification comes from a Raspberry Pi 3, specifically from its CPU (e.g., temperature, load, free memory, Wi-Fi sent and received packets). A k-nearest neighbors (KNN), random forest (RF), support vector machine (SVM), and Multilayer Perceptron (MLP) algorithms were trained. Considering metrics such as false positive rate, false negative rate, accuracy, F1-score, and execution time, we concluded that SVM and MLP were the best methods for the case study because of their accuracy (78.6 and 76.1, respectively) and low execution time (17.3ms and 0.35ms).
- 1 January 2025
- Published by Universidad de Antioquia in Revista Facultad de Ingeniería Universidad de Antioquia
Anomaly classification in IIoT edge devices
An early Industrial Internet of Things (IIoT) Anomaly Detection reduces maintenance costs, minimizes machine downtime, increases safety, and improves product quality. A multi-class classifier that detects events, failures, or attacks is much more efficient than a simple binary classifier, as it relieves a human operator of the task of identifying anomaly causes, thereby avoiding wasted time that could compromise process performance and security. With these issues in mind, this paper aims to determine whether it can differentiate between a failure that generates a temperature increase in an IIoT device processor, a denial-of-service attack on an MQTT broker, and an event caused by an application executing on the IIoT edge device. Data used to perform the classification comes from a Raspberry Pi 3, specifically from its CPU (e.g., temperature, load, free memory, Wi-Fi sent and received packets). A k-nearest neighbors (KNN), random forest (RF), support vector machine (SVM), and Multilayer Perceptron (MLP) algorithms were trained. Considering metrics such as false positive rate, false negative rate, accuracy, F1-score, and execution time, we concluded that SVM and MLP were the best methods for the case study because of their accuracy (78.6 and 76.1, respectively) and low execution time (17.3ms and 0.35ms).
- Open Access
- 30 November 2024
- Published by Elsevier in Internet of Things
- Vol. 29
A framework for anomaly classification in Industrial Internet of Things systems
- 30 November 2024
- Published by Elsevier in Internet of Things
- Vol. 29
Open AccessA framework for anomaly classification in Industrial Internet of Things systems
- Open Access
- 12 May 2023
- Published by Elsevier in Intelligent Systems with Applications
- Vol. 18
Anomaly classification in industrial Internet of things: A review
- 12 May 2023
- Published by Elsevier in Intelligent Systems with Applications
- Vol. 18
Open AccessAnomaly classification in industrial Internet of things: A review
- Open Access
- 3 April 2023
- Published by Elsevier in Internet of Things
- Vol. 22
DQ-MAN: A tool for multi-dimensional data quality analysis in IoT-based air quality monitoring systems
- 3 April 2023
- Published by Elsevier in Internet of Things
- Vol. 22
Open AccessDQ-MAN: A tool for multi-dimensional data quality analysis in IoT-based air quality monitoring systems
- Open Access
- 3 April 2023
- Published by Springer Nature in Water, Air, & Soil Pollution
- Vol. 234 (4) , 1-23
Data Quality in IoT-Based Air Quality Monitoring Systems: a Systematic Mapping Study
With the development of new technologies, particularly Internet of Things (IoT), there has been an increase in the deployment of low-cost air quality monitoring systems. Compared to traditional robust monitoring stations, these systems provide real-time information with higher spatio-temporal resolution. These systems use inexpensive and low-cost sensors, with lower accuracy as compared to robust systems. This fact has raised some concern regarding the quality of the data gathered by the IoT systems, which may compromise the performance of the environmental models. Considering the relevance of the data quality in this scenario, this paper presents a study of the data quality associated with IoT-based air quality monitoring systems. Following a systematic mapping method, and based on existing guidelines to assess data quality in these systems, we have identified the main Data Quality (DQ) dimensions and the corresponding DQ enhancement techniques. After analyzing more than 70 papers, we found that the most common DQ dimensions targeted by the different works are accuracy and precision, which are enhanced by the use of different calibration techniques. Based on our findings, we present a discussion on the challenges that must be addressed in order to improve data quality in IoT-based air quality monitoring systems.
- 3 April 2023
- Published by Springer Nature in Water, Air, & Soil Pollution
- Vol. 234 (4) , 1-23
Open AccessData Quality in IoT-Based Air Quality Monitoring Systems: a Systematic Mapping Study
With the development of new technologies, particularly Internet of Things (IoT), there has been an increase in the deployment of low-cost air quality monitoring systems. Compared to traditional robust monitoring stations, these systems provide real-time information with higher spatio-temporal resolution. These systems use inexpensive and low-cost sensors, with lower accuracy as compared to robust systems. This fact has raised some concern regarding the quality of the data gathered by the IoT systems, which may compromise the performance of the environmental models. Considering the relevance of the data quality in this scenario, this paper presents a study of the data quality associated with IoT-based air quality monitoring systems. Following a systematic mapping method, and based on existing guidelines to assess data quality in these systems, we have identified the main Data Quality (DQ) dimensions and the corresponding DQ enhancement techniques. After analyzing more than 70 papers, we found that the most common DQ dimensions targeted by the different works are accuracy and precision, which are enhanced by the use of different calibration techniques. Based on our findings, we present a discussion on the challenges that must be addressed in order to improve data quality in IoT-based air quality monitoring systems.
- 17 August 2021
- Published by Springer Nature
- p. 294-309
Solving QAP with Auto-parameterization in Parallel Hybrid Metaheuristics
- 17 August 2021
- Published by Springer Nature
- p. 294-309
Solving QAP with Auto-parameterization in Parallel Hybrid Metaheuristics