UNIVERSIDAD PABLO DE OLAVIDE
Publications
association rules astrostatistics big data bioinformatics clustering data streaming deep learning education energy feature selection IoT natural disasters pattern recognition time series transfer learning
2022 |
F. Morales and M. García-Torres and G. Velázquez and F. Daumas-Ladouce and P. Gardel-Sotomayor and F. Gómez-Vela and F. Divina and J.L. Vázquez Noguera and C. Sauer Ayala and D. Pinto-Roa Analysis of Electric Energy Consumption Profiles Using a Machine Learning Approach: A Paraguayan Case Study (Journal Article) Electronics, 11 (2), pp. 267, 2022. (Abstract | Links | BibTeX | Tags: clustering, energy, pattern recognition, time series) @article{morales2022analysis, title = {Analysis of Electric Energy Consumption Profiles Using a Machine Learning Approach: A Paraguayan Case Study}, author = {F. Morales and M. García-Torres and G. Velázquez and F. Daumas-Ladouce and P. Gardel-Sotomayor and F. Gómez-Vela and F. Divina and J.L. Vázquez Noguera and C. Sauer Ayala and D. Pinto-Roa}, url = {https://www.mdpi.com/2079-9292/11/2/267}, doi = {10.3390/electronics11020267}, year = {2022}, date = {2022-01-01}, journal = {Electronics}, volume = {11}, number = {2}, pages = {267}, publisher = {Multidisciplinary Digital Publishing Institute pubstate = published}, abstract = {Correctly defining and grouping electrical feeders is of great importance for electrical system operators. In this paper, we compare two different clustering techniques, K-means and hierarchical agglomerative clustering, applied to real data from the east region of Paraguay. The raw data were pre-processed, resulting in four data sets, namely, (i) a weekly feeder demand, (ii) a monthly feeder demand, (iii) a statistical feature set extracted from the original data and (iv) a seasonal and daily consumption feature set obtained considering the characteristics of the Paraguayan load curve. Considering the four data sets, two clustering algorithms, two distance metrics and five linkage criteria a total of 36 models with the Silhouette, Davies–Bouldin and Calinski–Harabasz index scores was assessed. The K-means algorithms with the seasonal feature data sets showed the best performance considering the Silhouette, Calinski–Harabasz and Davies–Bouldin validation index scores with a configuration of six clusters.}, keywords = {clustering, energy, pattern recognition, time series}, pubstate = {published}, tppubtype = {article} } Correctly defining and grouping electrical feeders is of great importance for electrical system operators. In this paper, we compare two different clustering techniques, K-means and hierarchical agglomerative clustering, applied to real data from the east region of Paraguay. The raw data were pre-processed, resulting in four data sets, namely, (i) a weekly feeder demand, (ii) a monthly feeder demand, (iii) a statistical feature set extracted from the original data and (iv) a seasonal and daily consumption feature set obtained considering the characteristics of the Paraguayan load curve. Considering the four data sets, two clustering algorithms, two distance metrics and five linkage criteria a total of 36 models with the Silhouette, Davies–Bouldin and Calinski–Harabasz index scores was assessed. The K-means algorithms with the seasonal feature data sets showed the best performance considering the Silhouette, Calinski–Harabasz and Davies–Bouldin validation index scores with a configuration of six clusters. |
L. Melgar-García and D. Gutiérrez-Avilés and M. T. Godinho and R. Espada and I. S. Brito and F. Martínez-Álvarez and A. Troncoso and C. Rubio-Escudero A new big data triclustering approach for extracting three-dimensional patterns in precision agriculture (Journal Article) Neurocomputing, in press , 2022. (BibTeX | Tags: big data, clustering, pattern recognition) @article{MELGAR21_NEUCOM, title = {A new big data triclustering approach for extracting three-dimensional patterns in precision agriculture}, author = {L. Melgar-García and D. Gutiérrez-Avilés and M. T. Godinho and R. Espada and I. S. Brito and F. Martínez-Álvarez and A. Troncoso and C. Rubio-Escudero}, year = {2022}, date = {2022-01-01}, journal = {Neurocomputing}, volume = {in press}, keywords = {big data, clustering, pattern recognition}, pubstate = {published}, tppubtype = {article} } |
2021 |
L. Melgar-García and D. Gutiérrez-Avilés and C. Rubio-Escudero and A. Troncoso Discovering three-dimensional patterns in real-time from data streams: An online triclustering approach (Journal Article) Information Sciences, 558 , pp. 174-193, 2021. (Abstract | Links | BibTeX | Tags: big data, IoT, pattern recognition) @article{Melgar21_IS, title = {Discovering three-dimensional patterns in real-time from data streams: An online triclustering approach}, author = {L. Melgar-García and D. Gutiérrez-Avilés and C. Rubio-Escudero and A. Troncoso}, url = {https://www.sciencedirect.com/science/article/pii/S0020025521000220}, doi = {10.1016/j.ins.2020.12.089}, year = {2021}, date = {2021-01-01}, journal = {Information Sciences}, volume = {558}, pages = {174-193}, abstract = {Triclustering algorithms group sets of coordinates of 3-dimensional datasets. In this paper, a new triclustering approach for data streams is introduced. It follows a streaming scheme of learning in two steps: offline and online phases. First, the offline phase provides a summary model with the components of the triclusters. Then, the second stage is the online phase to deal with data in streaming. This online phase consists in using the summary model obtained in the offline stage to update the triclusters as fast as possible with genetic operators. Results using three types of synthetic datasets and a real-world environmental sensor dataset are reported. The performance of the proposed triclustering streaming algorithm is compared to a batch triclustering algorithm, showing an accurate performance both in terms of quality and running times. }, keywords = {big data, IoT, pattern recognition}, pubstate = {published}, tppubtype = {article} } Triclustering algorithms group sets of coordinates of 3-dimensional datasets. In this paper, a new triclustering approach for data streams is introduced. It follows a streaming scheme of learning in two steps: offline and online phases. First, the offline phase provides a summary model with the components of the triclusters. Then, the second stage is the online phase to deal with data in streaming. This online phase consists in using the summary model obtained in the offline stage to update the triclusters as fast as possible with genetic operators. Results using three types of synthetic datasets and a real-world environmental sensor dataset are reported. The performance of the proposed triclustering streaming algorithm is compared to a batch triclustering algorithm, showing an accurate performance both in terms of quality and running times. |
M. A. Molina and G. Asencio-Cortés and J. C. Riquelme and F. Martínez-Álvarez A Preliminary Study on Deep Transfer Learning Applied to Image Classification for Small Datasets (Conference) 15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020), Advances in Intelligent Systems and Computing 2021. (Links | BibTeX | Tags: deep learning, pattern recognition, transfer learning) @conference{molina2021, title = {A Preliminary Study on Deep Transfer Learning Applied to Image Classification for Small Datasets}, author = {M. A. Molina and G. Asencio-Cortés and J. C. Riquelme and F. Martínez-Álvarez}, url = {https://link.springer.com/chapter/10.1007/978-3-030-57802-2_71}, year = {2021}, date = {2021-01-01}, booktitle = {15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020)}, series = {Advances in Intelligent Systems and Computing}, keywords = {deep learning, pattern recognition, transfer learning}, pubstate = {published}, tppubtype = {conference} } |
S.A. Grillo and J.C. Román and J.D. Mello-Román and J.L. Vázquez Noguera and M. García-Torres and F. Divina and P.E. Sotomayor Adjacent Inputs With Different Labels and Hardness in Supervised Learning (Journal Article) IEEE Access, pp. 162487–162498, 2021. (Links | BibTeX | Tags: feature selection, pattern recognition) @article{grillo2021adjacent, title = {Adjacent Inputs With Different Labels and Hardness in Supervised Learning}, author = {S.A. Grillo and J.C. Román and J.D. Mello-Román and J.L. Vázquez Noguera and M. García-Torres and F. Divina and P.E. Sotomayor}, doi = {10.1109/ACCESS.2021.3131150 volume=9}, year = {2021}, date = {2021-01-01}, journal = {IEEE Access}, pages = {162487--162498}, publisher = {IEEE pubstate = published}, keywords = {feature selection, pattern recognition}, pubstate = {published}, tppubtype = {article} } |
R. Parra and V. Ojeda and J.L. Vázquez Noguera and M. García-Torres and J.C. Mello-Román and C. Villalba and J. Facon and F. Divina and O. Cardozo and V. Castillo A Trust-Based Methodology to Evaluate Deep Learning Models for Automatic Diagnosis of Ocular Toxoplasmosis from Fundus Images (Journal Article) Diagnostics, 11 (11), pp. 1951, 2021. (Links | BibTeX | Tags: bioinformatics, deep learning, pattern recognition) @article{parra2021trust, title = {A Trust-Based Methodology to Evaluate Deep Learning Models for Automatic Diagnosis of Ocular Toxoplasmosis from Fundus Images}, author = {R. Parra and V. Ojeda and J.L. Vázquez Noguera and M. García-Torres and J.C. Mello-Román and C. Villalba and J. Facon and F. Divina and O. Cardozo and V. Castillo}, doi = {10.3390/diagnostics11111951}, year = {2021}, date = {2021-01-01}, journal = {Diagnostics}, volume = {11}, number = {11}, pages = {1951}, publisher = {Multidisciplinary Digital Publishing Institute pubstate = published}, keywords = {bioinformatics, deep learning, pattern recognition}, pubstate = {published}, tppubtype = {article} } |
J. Ayala and M. García-Torres and J.L. Vázquez Noguera and F. Gómez-Vela and F. Divina Technical analysis strategy optimization using a machine learning approach in stock market indices (Journal Article) Knowledge-Based Systems, pp. 107119, 2021. (Links | BibTeX | Tags: deep learning, pattern recognition) @article{ayala2021technical, title = {Technical analysis strategy optimization using a machine learning approach in stock market indices}, author = {J. Ayala and M. García-Torres and J.L. Vázquez Noguera and F. Gómez-Vela and F. Divina}, doi = {10.1016/j.knosys.2021.107119 volume=225}, year = {2021}, date = {2021-01-01}, journal = {Knowledge-Based Systems}, pages = {107119}, publisher = {Elsevier pubstate = published}, keywords = {deep learning, pattern recognition}, pubstate = {published}, tppubtype = {article} } |
2020 |
L. Melgar-García and M. T. Godinho and R. Espada and D. Gutiérrez-Avilés and I. S. Brito and F. Martínez-Álvarez and A. Troncoso and C. Rubio-Escudero Discovering Spatio-Temporal Patterns in Precision Agriculture Based on Triclustering (Conference) SOCO 15th International Conference on Soft Computing Models in Industrial and Environmental Applications, Advances in Intelligent Systems and Computing 2020. (Links | BibTeX | Tags: IoT, pattern recognition) @conference{SOCO20, title = {Discovering Spatio-Temporal Patterns in Precision Agriculture Based on Triclustering}, author = {L. Melgar-García and M. T. Godinho and R. Espada and D. Gutiérrez-Avilés and I. S. Brito and F. Martínez-Álvarez and A. Troncoso and C. Rubio-Escudero}, url = {https://link.springer.com/chapter/10.1007/978-3-030-57802-2_22}, year = {2020}, date = {2020-08-29}, booktitle = {SOCO 15th International Conference on Soft Computing Models in Industrial and Environmental Applications}, pages = {226-236}, series = {Advances in Intelligent Systems and Computing }, keywords = {IoT, pattern recognition}, pubstate = {published}, tppubtype = {conference} } |
C. Lezcano and J.L. Vázquez Noguera and D. P. Pinto-Roa and M. García-Torres and C. Gaona and P. E. Gardel-Sotomayor A multi-objective approach for designing optimized operation sequence on binary image processing (Journal Article) Heliyon, 6 (4), pp. e03670, 2020. (Abstract | BibTeX | Tags: pattern recognition) @article{Lezcano20, title = {A multi-objective approach for designing optimized operation sequence on binary image processing}, author = {C. Lezcano and J.L. Vázquez Noguera and D. P. Pinto-Roa and M. García-Torres and C. Gaona and P. E. Gardel-Sotomayor}, year = {2020}, date = {2020-01-01}, journal = {Heliyon}, volume = {6}, number = {4}, pages = {e03670}, abstract = {In binary image segmentation, the choice of the order of the operation sequence may yield to suboptimal results. In this work, we propose to tackle the associated optimization problem via multi-objective approach. Given the original image, in combination with a list of morphological, logical and stacking operations, the goal is to obtain the ideal output at the lowest computational cost. We compared the performance of two Multi-objective Evolutionary Algorithms (MOEAs): the Non-dominated Sorting Genetic Algorithm (NSGA-II) and the Strength Pareto Evolutionary Algorithm 2 (SPEA2). NSGA-II has better results in most cases, but the difference does not reach statistical significance. The results show that the similarity measure and the computational cost are objective functions in conflict, while the number of operations available and type of input images impact on the quality of Pareto set.}, keywords = {pattern recognition}, pubstate = {published}, tppubtype = {article} } In binary image segmentation, the choice of the order of the operation sequence may yield to suboptimal results. In this work, we propose to tackle the associated optimization problem via multi-objective approach. Given the original image, in combination with a list of morphological, logical and stacking operations, the goal is to obtain the ideal output at the lowest computational cost. We compared the performance of two Multi-objective Evolutionary Algorithms (MOEAs): the Non-dominated Sorting Genetic Algorithm (NSGA-II) and the Strength Pareto Evolutionary Algorithm 2 (SPEA2). NSGA-II has better results in most cases, but the difference does not reach statistical significance. The results show that the similarity measure and the computational cost are objective functions in conflict, while the number of operations available and type of input images impact on the quality of Pareto set. |
F. Daumas-Ladouce and M. García-Torres and J.L. Vázquez Noguera and D. P. Pinto-Roa and H. Legal-Alaya Multi-Objective Pareto Histogram Equalization (Journal Article) Electronic Notes in Theoretical Computer Science, 349 , pp. 3-23, 2020. (Abstract | BibTeX | Tags: pattern recognition) @article{Daumas-Ladouce20, title = {Multi-Objective Pareto Histogram Equalization}, author = {F. Daumas-Ladouce and M. García-Torres and J.L. Vázquez Noguera and D. P. Pinto-Roa and H. Legal-Alaya}, year = {2020}, date = {2020-01-01}, journal = {Electronic Notes in Theoretical Computer Science}, volume = {349}, pages = {3-23}, abstract = {Several histogram equalization methods focus on enhancing the contrast as one of their main objectives, but usually without considering the details of the input image. Other methods seek to keep the brightness while improving the contrast, causing distortion. Among the multi-objective algorithms, the classical optimization (a priori) techniques are commonly used given their simplicity. One of the most representative method is the weighted sum of metrics used to enhance the contrast of an image. These type of techniques, beside just returning a single image, have problems related to the weight assignment for each selected metric. To avoid the pitfalls of the algorithms just mentioned, we propose a new method called MOPHE (MultiObjective Pareto Histogram Equalization) which is based on Multi-objective Particle Swarm Optimization (MOPSO) approach combining different metrics in a posteriori selection criteria context. The goal of this method is three-fold: (1) improve the contrast (2) without losing important details, (3) avoiding an excessive distortion. MOPHE, is a pure multi-objective optimization algorithm, consequently a set of tradeoff optimal solutions are generated, thus providing alternative solutions to the decision-maker, allowing the selection of one or more resulting images, depending on the application needs. Experimental results indicate that MOPHE is a promising approach, as it calculates a set of trade-off optimal solutions that are better than the results obtained from representative algorithms from the state-of-the-art regarding visual quality and metrics measurement.}, keywords = {pattern recognition}, pubstate = {published}, tppubtype = {article} } Several histogram equalization methods focus on enhancing the contrast as one of their main objectives, but usually without considering the details of the input image. Other methods seek to keep the brightness while improving the contrast, causing distortion. Among the multi-objective algorithms, the classical optimization (a priori) techniques are commonly used given their simplicity. One of the most representative method is the weighted sum of metrics used to enhance the contrast of an image. These type of techniques, beside just returning a single image, have problems related to the weight assignment for each selected metric. To avoid the pitfalls of the algorithms just mentioned, we propose a new method called MOPHE (MultiObjective Pareto Histogram Equalization) which is based on Multi-objective Particle Swarm Optimization (MOPSO) approach combining different metrics in a posteriori selection criteria context. The goal of this method is three-fold: (1) improve the contrast (2) without losing important details, (3) avoiding an excessive distortion. MOPHE, is a pure multi-objective optimization algorithm, consequently a set of tradeoff optimal solutions are generated, thus providing alternative solutions to the decision-maker, allowing the selection of one or more resulting images, depending on the application needs. Experimental results indicate that MOPHE is a promising approach, as it calculates a set of trade-off optimal solutions that are better than the results obtained from representative algorithms from the state-of-the-art regarding visual quality and metrics measurement. |
D. S. Rodríguez-Baena and F. Gómez-Vela and M. García-Torres and F. Divina and C. D. Barranco and N- Díaz-Díaz and M. Jimenez and G. Montalvo Identifying livestock behavior patterns based on accelerometer dataset (Journal Article) Journal of Computational Science, 41 , pp. 101076, 2020. (Abstract | Links | BibTeX | Tags: pattern recognition) @article{Rodriguez-Baena20, title = {Identifying livestock behavior patterns based on accelerometer dataset}, author = {D. S. Rodríguez-Baena and F. Gómez-Vela and M. García-Torres and F. Divina and C. D. Barranco and N- Díaz-Díaz and M. Jimenez and G. Montalvo}, url = {https://doi.org/10.1016/j.jocs.2020.101076}, doi = {10.1016/j.jocs.2020.101076}, year = {2020}, date = {2020-01-01}, journal = {Journal of Computational Science}, volume = {41}, pages = {101076}, abstract = {In large livestock farming it would be beneficial to be able to automatically detect behaviors in animals. In fact, this would allow to estimate the health status of individuals, providing valuable insight to stock raisers. Traditionally this process has been carried out manually, relying only on the experience of the breeders. Such an approach is effective for a small number of individuals. However, in large breeding farms this may not represent the best approach, since, in this way, not all the animals can be effectively monitored all the time. Moreover, the traditional approach heavily rely on human experience, which cannot be always taken for granted. To this aim, in this paper, we propose a new method for automatically detecting activity and inactivity time periods of animals, as a behavior indicator of livestock. In order to do this, we collected data with sensors located in the body of the animals to be analyzed. In particular, the reliability of the method was tested with data collected on Iberian pigs and calves. Results confirm that the proposed method can help breeders in detecting activity and inactivity periods for large livestock farming.}, keywords = {pattern recognition}, pubstate = {published}, tppubtype = {article} } In large livestock farming it would be beneficial to be able to automatically detect behaviors in animals. In fact, this would allow to estimate the health status of individuals, providing valuable insight to stock raisers. Traditionally this process has been carried out manually, relying only on the experience of the breeders. Such an approach is effective for a small number of individuals. However, in large breeding farms this may not represent the best approach, since, in this way, not all the animals can be effectively monitored all the time. Moreover, the traditional approach heavily rely on human experience, which cannot be always taken for granted. To this aim, in this paper, we propose a new method for automatically detecting activity and inactivity time periods of animals, as a behavior indicator of livestock. In order to do this, we collected data with sensors located in the body of the animals to be analyzed. In particular, the reliability of the method was tested with data collected on Iberian pigs and calves. Results confirm that the proposed method can help breeders in detecting activity and inactivity periods for large livestock farming. |
0000 |
M. García-Torres and F. Gómez-Vela and F. Divina and D.P. Pinto-Roa and J.L. Vázquez Noguera and J.C. Román Scatter search for high-dimensional feature selection using feature grouping (Conference) Proceedings of the Genetic and Evolutionary Computation Conference Companion, 0000. (Links | BibTeX | Tags: big data, feature selection, pattern recognition) @conference{garcia2021scatter, title = {Scatter search for high-dimensional feature selection using feature grouping}, author = {M. García-Torres and F. Gómez-Vela and F. Divina and D.P. Pinto-Roa and J.L. Vázquez Noguera and J.C. Román}, doi = {10.1145/3449726.3459481 pages=149--150}, booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference Companion}, keywords = {big data, feature selection, pattern recognition}, pubstate = {published}, tppubtype = {conference} } |