Pilar M. Ortigosa

Dr. Pilar M. Ortigosa

University of Almeria (Spain)
orcid

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2013 in Energy and Buildings
Verified
Journal Article
Closed access
José Domingo ÁlvarezJosé Domingo Álvarez
José Domingo Álvarez
JRJ.L. Redondo
J.L. Redondo
ECE. Camponogara
E. Camponogara
Julio Normey-RicoJulio Normey-Rico
Julio Normey-Rico
Manuel BerenguelManuel Berenguel
Manuel Berenguel
Pilar M. OrtigosaPilar M. Ortigosa
Pilar M. Ortigosa

1 May 2017 in Renewable and Sustainable Energy Reviews
Verified
Journal Article
Closed access
NCNicolás C. Cruz
Nicolás C. Cruz
JRJ.L. Redondo
J.L. Redondo
MBM. Berenguel
M. Berenguel
José Domingo ÁlvarezJosé Domingo Álvarez
José Domingo Álvarez
Pilar M. OrtigosaPilar M. Ortigosa
Pilar M. Ortigosa

1 November 2006 in Microprocessors and Microsystems
Verified
Journal Article
Closed access
EOE.M. Ortigosa
E.M. Ortigosa
ACA. Cañas
A. Cañas
ERE. Ros
E. Ros
Pilar M. OrtigosaPilar M. Ortigosa
Pilar M. Ortigosa
SMS. Mota
S. Mota
JDJ. Díaz
J. Díaz

23 November 2023 in Information Fusion
Verified
Journal Article
Closed access
Marcos Lupion LorenteMarcos Lupion Lorente
Marcos Lupion Lorente
APAurora Polo-Rodríguez
Aurora Polo-Rodríguez
JMJavier Medina-Quero
Javier Medina-Quero
JSJuan F. Sanjuan
Juan F. Sanjuan
Pilar M. OrtigosaPilar M. Ortigosa
Pilar M. Ortigosa

12 February 2024 in IEEE Journal of Biomedical and Health Informatics
Verified
Journal Article
Closed access
Marcos Lupion LorenteMarcos Lupion Lorente
Marcos Lupion Lorente
FCFederico Cruciani
Federico Cruciani
Ian ClelandIan Cleland
Ian Cleland
Chris NugentChris Nugent
Chris Nugent
Pilar M. OrtigosaPilar M. Ortigosa
Pilar M. Ortigosa
Currently, Human Activity Recognition (HAR) applications need a large volume of data to be able to generalize to new users and environments. However, the availability of labeled data is usually limited and the process of recording new data is costly and time-consuming. Synthetically increasing datasets using Generative Adversarial Networks (GANs) has been proposed, outperforming cropping, time-warping, and jittering techniques on raw signals. Incorporating GAN-generated synthetic data into datasets has been demonstrated to improve the accuracy of trained models. Regardless, currently, there is no optimal GAN architecture to generate accelerometry signals, neither a proper evaluation methodology to assess signal quality or accuracy using synthetic data. This work is the first to propose conditional Wasserstein Generative Adversarial Networks (cWGANs) to generate synthetic HAR accelerometry signals. Furthermore, we calculate quality metrics from the literature and study the impact of synthetic data on a large HAR dataset involving 395 users. Results show that i) cWGAN outperforms original Conditional Generative Adversarial Networks (cGANs), being 1D convolutional layers appropriate for generating accelerometry signals, ii) the performance improvement incorporating synthetic data is more significant as the dataset size is smaller, and iii) the quantity of synthetic data required is inversely proportional to the quantity of real data.

1 March 2009 in Evolutionary Computation
Verified
Journal Article
Closed access
JRJuana López Redondo
Juana López Redondo
JFJosé Fernández
José Fernández
IGInmaculada García
Inmaculada García
Pilar M. OrtigosaPilar M. Ortigosa
Pilar M. Ortigosa
A continuous location problem in which a firm wants to set up two or more new facilities in a competitive environment is considered. Other facilities offering the same product or service already exist in the area. Both the locations and the qualities of the new facilities are to be found so as to maximize the profit obtained by the firm. This is a global optimization problem, with many local optima. In this paper we analyze several approaches to solve it, namely, three multistart local search heuristics, a multistart simulated annealing algorithm, and two variants of an evolutionary algorithm. Through a comprehensive computational study it is shown that the evolutionary algorithms are the heuristics that provide the best solutions. Furthermore, using a set of problems for which the optimal solutions are known, only the evolutionary algorithms were able to find the optimal solutions for all the instances. The evolutionary strategies presented in this paper can be easily adapted to handle other continuous location problems.