Pasar al contenido principal

GESTION EFICIENTE DEL CONSUMO ELECTRICO MEDIANTE LA CLASIFICACION, PREDICCION Y AGRUPAMIENTO DE SERIES TEMPORALES

TIN2017-82626-R

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2017
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario ASOC BCAM - BASQUE CENTER FOR APPLIED MATHEMATICS

Resultados relacionados

Resultados totales (Incluyendo duplicados): 35
Encontrada(s) 1 página(s)

BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

Soft range information for network localization

  • Mazuelas, S.
  • Conti, A.
  • Allen, J.C.
  • Win, M.Z.
The demand for accurate localization in complex environments continues to increase despite the difficulty in extracting positional information from measurements. Conventional range-based localization approaches rely on distance estimates obtained from measurements (e.g., delay or strength of received waveforms). This paper goes one step further and develops localization techniques that rely on all probable range values rather than on a single estimate of each distance. In particular, the concept of soft range information (SRI) is introduced, showing its essential role for network localization. We then establish a general framework for SRI-based localization and develop algorithms for obtaining the SRI using machine learning techniques. The performance of the proposed approach is quantified via network experimentation in indoor environments. The results show that SRI-based localization techniques can achieve performance approaching the Cramer–Rao lower bound and significantly outperform the conventional techniques especially in harsh wireless environments., RYC-2016-19383
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Are the artificially generated instances uniform in terms of difficulty?

  • Pérez, A.
  • Ceberio, J.
  • Lozano, J.A.
In the field of evolutionary computation, it is usual to generate artificial benchmarks of instances that are used as a test-bed to determine the performance of the algorithms at hand. In this context, a recent work on permutation problems analyzed the implications of generating instances uniformly at random (u.a.r.) when building those benchmarks. Particularly, the authors analyzed instances as rankings of the solutions of the search space sorted according to their objective function value. Thus, two instances are considered equivalent when their objective functions induce the same ranking over the search space. Based on the analysis, they suggested that, when some restrictions hold, the probability to create easy rankings is higher than creating difficult ones. In this paper, we continue on that research line by adopting the framework of local search algorithms with the best improvement criterion. Particularly, we empirically analyze, in terms of difficulty, the instances (rankings) created u.a.r. of three popular problems: Linear Ordering Problem, Quadratic Assignment Problem and Flowshop Scheduling Problem. As the neighborhood system is critical for the performance of local search algorithms three different neighborhood systems have been considered: swap, interchange and insert. Conducted experiments reveal that (1) by sampling the parameters uniformly at random we obtain instances with a non-uniform distribution in terms of difficulty, (2) the distribution of the difficulty strongly depends on the pair problem-neighborhood considered, and (3) given a problem, the distribution of the difficulty seems to depend on the smoothness of the landscape induced by the neighborhood and on its size., Research Groups 2013-2018 (IT-609-13) TIN2016-78365-R(Spanish Ministry of Economy, Industry and Competitiveness)
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

Spacecraft Trajectory Optimization: A review of Models, Objectives, Approaches and Solutions

  • Shirazi, A.
  • Ceberio, J.
  • Lozano, J.A.
This article is a survey paper on solving spacecraft trajectory optimization problems. The solving process is decomposed into four key steps of mathematical modeling of the problem, defining the objective functions, development of an approach and obtaining the solution of the problem. Several subcategories for each step have been identified and described. Subsequently, important classifications and their characteristics have been discussed for solving the problems. Finally, a discussion on how to choose an element of each step for a given problem is provided., La Caixa, TIN2016-78365-R
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

A review on distance based time series classification

  • Abanda, A.
  • Mori, U.
  • Lozano, J.A.
Time series classification is an increasing research topic due to the vast amount of time series data that is being created over a wide variety of fields. The particularity of the data makes it a challenging task and different approaches have been taken, including the distance based approach. 1-NN has been a widely used method within distance based time series classification due to its simplicity but still good performance. However, its supremacy may be attributed to being able to use specific distances for time series within the classification process and not to the classifier itself. With the aim of exploiting these distances within more complex classifiers, new approaches have arisen in the past few years that are competitive or which outperform the 1-NN based approaches. In some cases, these new methods use the distance measure to transform the series into feature vectors, bridging the gap between time series and traditional classifiers. In other cases, the distances are employed to obtain a time series kernel and enable the use of kernel methods for time series classification. One of the main challenges is that a kernel function must be positive semi-definite, a matter that is also addressed within this review. The presented review includes a taxonomy of all those methods that aim to classify time series using a distance based approach, as well as a discussion of the strengths and weaknesses of each method., TIN2016-78365-R
BIRD. BCAM's Institutional Repository Data
Publicación Capítulo o parte de un libro (BookPart)

Crowd Learning with Candidate Labeling: an EM-based Solution

  • Beñaran-Muñoz, I.
  • Hernández-González, J.
  • Pérez, A.
Crowdsourcing is widely used nowadays in machine learning for data labeling. Although in the traditional case annotators are asked to provide a single label for each instance, novel approaches allow annotators, in case of doubt, to choose a subset of labels as a way to extract more information from them. In both the traditional and these novel approaches, the reliability of the labelers can be modeled based on the collections of labels that they provide. In this paper, we propose an Expectation-Maximization-based method for crowdsourced data with candidate sets. Iteratively the likelihood of the parameters that model the reliability of the labelers is maximized, while the ground truth is estimated. The experimental results suggest that the proposed method performs better than the baseline aggregation schemes in terms of estimated accuracy., BES-2016-078095 SVP-2014-068574 IT609-13 TIN2016-78365-R
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

Calibration Model Maintenance in Melamine Resin Production: Integrating Drift Detection, Smart Sample Selection and Model Adaptation

  • Nikzad-Langerodi, R.
  • Lughofer, E.
  • Cernuda, C.
  • Reischer, T.
  • Kantner, W.
  • Pawliczek, M.
  • Brandstetter, M.
The physico-chemical properties of Melamine Formaldehyde (MF) based thermosets are largely influenced by the degree of polymerization (DP) in the underlying resin. On-line supervision of the turbidity point by means of vibrational spectroscopy has recently emerged as a promising technique to monitor the DP of MF resins. However, spectroscopic determination of the DP relies on chemometric models, which are usually sensitive to drifts caused by instrumental and/or sample associated changes occurring over time. In order to detect the time point when drifts start causing prediction bias, we here explore a universal drift detector based on a faded version of the Page-Hinkley (PH) statistic, which we test in three data streams from an industrial MF resin production process. We employ committee disagreement (CD), computed as the variance of model predictions from an ensemble of partial least squares (PLS) models, as a measure for sample-wise prediction uncertainty and use the PH statistic to detect hanges in this quantity. We further explore supervised and unsupervised strategies for (semi-)automatic model adaptation upon detection of a drift. For the former, manual reference measurements are requested whenever statistical thresholds on Hotelling’s $T^2$ and/or Q-Residuals are violated. Models are subsequently re-calibrated using weighted partial least squares in order to increase the influence of newer samples, which increases the flexibility when adapting to new (drifted) states. Unsupervised model adaptation is carried out exploiting the dual antecedent-consequent structure of a recently developed fuzzy systems variant of PLS termed FLEXFIS-PLS. In particular, antecedent parts are updated while maintaining the internal structure of the local linear predictors (i.e. the consequents). We found improved drift detection capability of the CD compared to Hotelling’s $T^2$ and Q-Residuals when used in combination with the proposed PH test. Furthermore, we found that active selection of samples by active learning (AL) used for subsequent model adaptation is advantageous compared to passive (random) selection in case that a drift leads to persistent prediction bias allowing more rapid adaptation at lower reference measurement rates. Fully unsupervised adaptation using FLEXFIS-PLS could improve predictive accuracy significantly for light drifts but was not able to fully compensate for prediction bias in case of significant lack of fit w.r.t. the latent variable space.
BIRD. BCAM's Institutional Repository Data
Publicación Capítulo o parte de un libro (BookPart)

On the relevance of preprocessing in predictive maintenance for dynamic systems

  • Cernuda, C.
The complexity involved in the process of real-time data-driven monitoring dynamic systems for predicted maintenance is usually huge. With more or less in-depth any data-driven approach is sensitive to data preprocessing, understood as any data treatment prior to the application of the monitoring model, being sometimes crucial for the final development of the employed monitoring technique. The aim of this work is to quantify the sensitiveness of data-driven predictive maintenance models in dynamic systems in an exhaustive way. We consider a couple of predictive maintenance scenarios, each of them defined by some public available data. For each scenario, we consider its properties and apply several techniques for each of the successive preprocessing steps, e.g. data cleaning, missing values treatment, outlier detection, feature selection, or imbalance compensation. The pretreatment configurations, i.e. sequential combinations of techniques from different preprocessing steps, are considered together with different monitoring approaches, in order to determine the relevance of data preprocessing for predictive maintenance in dynamical systems.
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

Mallows and generalized Mallows model for matchings

  • Irurozki, E.
  • Calvo, B.
  • Lozano, J.A.
The Mallows and Generalized Mallows Models are two of the most popular probability models for distribu- tions on permutations. In this paper, we consider both models under the Hamming distance. This models can be seen as models for matchings instead of models for rankings. These models cannot be factorized, which contrasts with the popular MM and GMM under Kendall’s-τ and Cayley distances. In order to overcome the computational issues that the models involve, we introduce a novel method for computing the partition function. By adapting this method we can compute the expectation, joint and conditional probabilities. All these methods are the basis for three sampling algorithms, which we propose and analyze. Moreover, we also propose a learning algorithm. All the algorithms are analyzed both theoretically and empirically, using synthetic and real data from the context of e-learning and Massive Open Online Courses (MOOC).
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

An evolutionary discretized Lambert approach for optimal long-range rendezvous considering impulse limit

  • Shirazi, A.
  • Ceberio, J.
  • Lozano, J.A.
In this paper, an approach is presented for finding the optimal long-range space rendezvous in terms of fuel and time, considering limited impulse. In this approach , the Lambert problem is expanded towards a discretized multi-impulse transfer. Taking advantage of an analytical form of multi-impulse transfer, a feasible solution that satisfies the impulse limit is calculated. Next, the obtained feasible solution is utilized as a seed for generating individuals for a hybrid self-adaptive evolutionary algorithm to minimize the total time, without violating the impulse limit while keeping the overall fuel mass the same as or less than the one associated with the analytical solution. The algorithm eliminates similar individuals and regenerates them based on a combination of Gaussian and uniform distribution of solutions from the fuel-optimal region during the optimization process. Other enhancements are also applied to the algorithm to make it auto-tuned and robust to the initial and final orbits as well as the impulse limit. Several types of the proposed algorithm are tested considering varieties of rendezvous missions. Results reveal that the approach can successfully reduce the overall transfer time in the multi-impulse transfers while minimizing the fuel mass without violating the impulse limit. Furthermore, the proposed algorithm has superior performance over standard evolutionary algorithms in terms of convergence and optimality., TIN2016-78365R
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Optimal multi-impulse space rendezvous considering limited impulse using a discretized Lambert problem combined with evolutionary algorithms

  • Shirazi, A.
  • Ceberio, J.
  • Lozano, J.A.
In this paper, a direct approach is presented to tackle the multi-impulse rendezvous problem considering the impulse limit. Particularly, the standard Lambert problem is extended toward several consequential orbit transfers for the rendezvous problem. A number of different evolutionary algorithms are taken into consideration. It is shown that the proposed approach can lead to the optimal multi-impulse transfer maneuver that has the minimum amount of fuel similar to the traditional two-impulse transfer without violating the impulse limitation. Results also indicate that the approach is efficient even when the number of stages increases due to lower impulse limitations.
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Sentiment analysis with genetically evolved Gaussian kernels

  • Roman, I.
  • Santana, R.
  • Mendiburu, A.
  • Lozano, J.A.
Sentiment analysis consists of evaluating opinions or statements based on text analysis. Among the methods used to estimate the degree to which a text expresses a certain sentiment are those based on Gaussian Processes. However, traditional Gaussian Processes methods use a prede- fined kernels with hyperparameters that can be tuned but whose structure can not be adapted. In this paper, we propose the application of Genetic Programming for the evolution of Gaussian Process kernels that are more precise for sentiment analysis. We use use a very flexible representation of kernels combined with a multi-objective approach that considers si- multaneously two quality metrics and the computational time required to evaluate those kernels. Our results show that the algorithm can outper- form Gaussian Processes with traditional kernels for some of the sentiment analysis tasks considered.
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Approaching the Quadratic Assignment Problem with Kernels of Mallows Models under the Hamming Distance

  • Arza, E.
  • Ceberio, J.
  • Pérez, A.
  • Irurozki, E.
The Quadratic Assignment Problem (QAP) is a specially challenging permutation-based np-hard combinatorial optimization problem, since instances of size $n>40$ are seldom solved using exact methods. In this sense, many approximate methods have been published to tackle this problem, including Estimation of Distribution Algorithms (EDAs). In particular, EDAs have been used to solve permutation problems by introducing distance based exponential models, such as the Mallows Models. In this paper we approximate the QAP with a Hamming distance based kernels of Mallows Models. Based on the benchmark instances, we have observed that our approach is competitive, reaching the best-known solution in $71\%$ of the tested instances, especially on large instances ($n>125$), where it is able to outperform state of the art results in 43 out of 288 instances., TIN2016-78365-R SVP-2014-068574 SEV-2013-0323
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

On-line Elastic Similarity Measures for time series

  • Oregui, I.
  • Pérez, A.
  • Del Ser, J.
  • Lozano, J.A.
The way similarity is measured among time series is of paramount importance in many data mining and machine learning tasks. For instance, Elastic Similarity Measures are widely used to determine whether two time series are similar to each other. Indeed, in off-line time series mining, these measures have been shown to be very effective due to their ability to handle time distortions and mitigate their effect on the resulting distance. In the on-line setting, where available data increase continuously over time and not necessary in a stationary manner, stream mining approaches are required to be fast with limited memory consumption and capable of adapting to different stationary intervals. In this sense, the computational complexity of Elastic Similarity Measures and their lack of flexibility to accommodate different stationary intervals, make these similarity measures incompatible with the requirements mentioned. To overcome these issues, this paper adapts the family of Elastic Similarity Measures – which includes Dynamic Time Warping, Edit Distance, Edit Distance for Real Sequences and Edit Distance with Real Penalty – to the on-line setting. The proposed adaptation is based on two main ideas: a forgetting mechanism and the incremental computation. The former makes the similarity consistent with streaming time series characteristics by giving more importance to recent observations, whereas the latter reduces the computational complexity by avoiding unnecessary computations. In order to assess the behavior of the proposed similarity measure in on-line settings, two different experiments have been carried out. The first aims at showing the efficiency of the proposed adaptation, to do so we calculate and compare the computation time for the elastic measures and their on-line adaptation. By analyzing the results drawn from a distance-based streaming machine learning model, the second experiment intends to show the effect of the forgetting mechanism on the resulting similarity value. The experimentation shows, for the aforementioned Elastic Similarity Measures, that the proposed adaptation meets the memory, computational complexity and flexibility constraints imposed by streaming data.
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

On the evaluation and selection of classifier learning algorithms with crowdsourced data

  • Urkullu, A.
  • Pérez, A.
  • Calvo, B.
In many current problems, the actual class of the instances, the ground truth, is unavail- able. Instead, with the intention of learning a model, the labels can be crowdsourced by harvesting them from different annotators. In this work, among those problems we fo- cus on those that are binary classification problems. Specifically, our main objective is to explore the evaluation and selection of models through the quantitative assessment of the goodness of evaluation methods capable of dealing with this kind of context. That is a key task for the selection of evaluation methods capable of performing a sensible model selection. Regarding the evaluation and selection of models in such contexts, we identify three general approaches, each one based on a different interpretation of the nature of the underlying ground truth: deterministic, subjectivist or probabilistic. For the analysis of these three approaches, we propose how to estimate the Area Under the Curve (AUC) of the Receiver Operating Characteristic (ROC) curve within each interpretation, thus deriving three evaluation methods. These methods are compared in extensive experimentation whose empirical results show that the probabilistic method generally overcomes the other two, as a result of which we conclude that it is advisable to use that method when performing the evaluation in such contexts. In further studies, it would be interesting to extend our research to multiclass classification problems.
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

Supervised non-parametric discretization based on Kernel density estimation

  • Flores, J.L.
  • Calvo, B.
  • Pérez, A.
Nowadays, machine learning algorithms can be found in many applications where the classifiers play a key role. In this context, discretizing continuous attributes is a common step previous to classification tasks, the main goal being to retain as much discriminative information as possible. In this paper, we propose a supervised univariate non-parametric discretization algorithm which allows the use of a given supervised score criterion for selecting the best cut points. The candidate cut points are evaluated by computing the selected score value using kernel density estimation. The computational complexity of the proposed procedure is O(N log N), where N is the length of the data. Our proposed algorithm generates a low complexity in discretization policies while retaining the discriminative information of the original continuous variables. In order to assess the validity of the proposed method, a set of real and artificial datasets has been used and the results show that the algorithm provides competitive results in terms of performance, a low complexity in the discretization policies and a high performance.
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

An efficient K-means clustering algorithm for tall data

  • Capo, M.
  • Pérez, A.
  • Lozano, J.A.
The analysis of continously larger datasets is a task of major importance in a wide variety of scientific fields. Therefore, the development of efficient and parallel algorithms to perform such an analysis is a a crucial topic in unsupervised learning. Cluster analysis algorithms are a key element of exploratory data analysis and, among them, the K-means algorithm stands out as the most popular approach due to its easiness in the implementation, straightforward parallelizability and relatively low computational cost. Unfortunately, the K-means algorithm also has some drawbacks that have been extensively studied, such as its high dependency on the initial conditions, as well as to the fact that it might not scale well on massive datasets. In this article, we propose a recursive and parallel approximation to the K-means algorithm that scales well on the number of instances of the problem, without affecting the quality of the approximation. In order to achieve this, instead of analyzing the entire dataset, we work on small weighted sets of representative points that are distributed in such a way that more importance is given to those regions where it is harder to determine the correct cluster assignment of the original instances. In addition to different theoretical properties, which explain the reasoning behind the algorithm, experimental results indicate that our method outperforms the state-of-the-art in terms of the trade-off between number of distance computations and the quality of the solution obtained.
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

An adaptive neuroevolution-based hyperheuristic

  • Arza, E.
  • Ceberio, J.
  • Pérez, A.
  • Irurozki, E.
According to the No-Free-Lunch theorem, an algorithm that performs efficiently on any type of problem does not exist. In this sense, algorithms that exploit problem-specific knowledge usually outperform more generic approaches, at the cost of a more complex design and parameter tuning process. Trying to combine the best of both worlds, the field of hyperheuristics investigates the automatized generation and hybridization of heuristic algorithms. In this paper, we propose a neuroevolution-based hyperheuristic approach. Particularly, we develop a population-based hyperheuristic algorithm that first trains a neural network on an instance of a problem and then uses the trained neural network to control how and which low-level operators are applied to each of the solutions when optimizing different problem instances. The trained neural network maps the state of the optimization process to the operations to be applied to the solutions in the population at each generation., TIN2016-78365R BERC 2014-2017 Research Groups 2013-2018 (IT-609-13).
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

Kernels of Mallows Models under the Hamming Distance for solving the Quadratic Assignment Problem

  • Arza, E.
  • Pérez, A.
  • Irurozki, E.
  • Ceberio, J.
The Quadratic Assignment Problem (QAP) is a well-known permutation-based combinatorial optimization problem with real applications in industrial and logistics environments. Motivated by the challenge that this NP-hard problem represents, it has captured the attention of the optimization community for decades. As a result, a large number of algorithms have been proposed to tackle this problem. Among these, exact methods are only able to solve instances of size $n<40$. To overcome this limitation, many metaheuristic methods have been applied to the QAP. In this work, we follow this direction by approaching the QAP through Estimation of Distribution Algorithms (EDAs). Particularly, a non-parametric distance-based exponential probabilistic model is used. Based on the analysis of the characteristics of the QAP, and previous work in the area, we introduce Kernels of Mallows Model under the Hamming distance to the context of EDAs. Conducted experiments point out that the performance of the proposed algorithm in the QAP is superior to (i) the classical EDAs adapted to deal with the QAP, and also (ii) to the specific EDAs proposed in the literature to deal with permutation problems., Severo Ochoa SEV-2013-0323 TIN2016-78365-R PID2019-106453GAI00 SVP-2014-068574 TIN2017-82626-R
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

General supervision via probabilistic transformations

  • Mazuelas, S.
  • Pérez, A.
Different types of training data have led to numerous schemes for supervised classification. Current learning techniques are tailored to one specific scheme and cannot handle general ensembles of training samples. This paper presents a unifying framework for supervised classification with general ensembles of training samples, and proposes the learning methodology of generalized robust risk minimization (GRRM). The paper shows how current and novel supervision schemes can be addressed under the proposed framework by representing the relationship between examples at prediction and training via probabilistic transformations. The results show that GRRM can handle different types of training samples in a unified manner, and enable new supervision schemes that aggregate general ensembles of training samples., RYC-2016-19383
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

A Machine Learning Approach to Predict Healthcare Cost of Breast Cancer Patients

  • Rakshit, P.
  • Zaballa, O.
  • Pérez, A.
  • Gomez-Inhiesto, E.
  • Acaiturri-Ayesta, M.T.
  • Lozano, J.A.
This paper presents a novel machine learning approach to per- form an early prediction of the healthcare cost of breast cancer patients. The learning phase of our prediction method considers the following two steps: i) in the first step, the patients are clustered taking into account the sequences of ac- tions undergoing similar clinical activities and ensuring similar healthcare costs, and ii) a Markov chain is then learned for each group to describe the action- sequences of the patients in the cluster. A two step procedure is undertaken in the prediction phase: i) first, the healthcare cost of a new patient’s treatment is estimated based on the average healthcare cost of its k−nearest neighbors in each group, and ii) finally, an aggregate measure of the healthcare cost estimated by each group is used as the final predicted cost. Experiments undertaken reveal a mean absolute percentage error as small as 6%, even when half of the clinical records of a patient is available, substantiating the early prediction capability of the proposed method. Comparative analysis substantiates the superiority of the proposed algorithm over the state-of-the-art techniques., IT1244-19 PID2019-104966GB-I00 TIN2016-78365-R
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

Identifying common treatments from Electronic Health Records with missing information. An application to breast cancer.

  • Zaballa, O.
  • Pérez, A.
  • Gómez-Inhiesto, E.
  • Acaiturri-Ayesta, T.
  • Lozano, J.A.
The aim of this paper is to analyze the sequence of actions in the health system associated with a particular disease. In order to do that, using Electronic Health Records, we define a general methodology that allows us to: (I) identify the actions in the health system associated with a disease; (ii) identify those patients with a complete treatment for the disease; (iii) and discover common treatment pathways followed by the patients with a specific diagnosis. The methodology takes into account the characteristics of the EHRs, such as record heterogeneity and missing information. As an example, we use the proposed methodology to analyze breast cancer disease. For this diagnosis, 5 groups of treatments, which fit in with medical practice guidelines and expert knowledge, were obtained., Artificial Intelligence in BCAM number EXP. 2019/00432, PID2019-104966GB-I00, TIN2016-78365-R, IT1244-19.
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

Probabilistic Load Forecasting Based on Adaptive Online Learning

  • Álvarez, V.
  • Mazuelas, S.
  • Lozano, J.A.
Load forecasting is crucial for multiple energy management tasks such as scheduling generation capacity, planning supply and demand, and minimizing energy trade costs. Such relevance has increased even more in recent years due to the integration of renewable energies, electric cars, and microgrids. Conventional load forecasting techniques obtain singlevalue load forecasts by exploiting consumption patterns of past load demand. However, such techniques cannot assess intrinsic uncertainties in load demand, and cannot capture dynamic changes in consumption patterns. To address these problems, this paper presents a method for probabilistic load forecasting based on the adaptive online learning of hidden Markov models. We propose learning and forecasting techniques with theoretical guarantees, and experimentally assess their performance in multiple scenarios. In particular, we develop adaptive online learning techniques that update model parameters recursively, and sequential prediction techniques that obtain probabilistic forecasts using the most recent parameters. The performance of the method is evaluated using multiple datasets corresponding with regions that have different sizes and display assorted time-varying consumption patterns. The results show that the proposed method can significantly improve the performance of existing techniques for a wide range of scenarios., Ramon y Cajal Grant RYC-2016-19383 Basque Government under the grant "Artificial Intelligence in BCAM number EXP. 2019/00432" Iberdrola Foundation under the 2019 Research Grants
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Minimax Classification with 0-1 Loss and Performance Guarantees

  • Mazuelas, S.
  • Zanoni, A.
  • Pérez, A.
Supervised classification techniques use training samples to find classification rules with small expected 0-1 loss. Conventional methods achieve efficient learning and out-of-sample generalization by minimizing surrogate losses over specific families of rules. This paper presents minimax risk classifiers (MRCs) that do not rely on a choice of surrogate loss and family of rules. MRCs achieve efficient learning and out-of-sample generalization by minimizing worst-case expected 0-1 loss w.r.t. uncertainty sets that are defined by linear constraints and include the true underlying distribution. In addition, MRCs’ learning stage provides performance guarantees as lower and upper tight bounds for expected 0-1 loss. We also present MRCs’ finite-sample generalization bounds in terms of training size and smallest minimax risk, and show their competitive classification performance w.r.t. state-of-the-art techniques using benchmark datasets., Ramon y Cajal Grant RYC-2016-19383
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

Simulation Framework for Orbit Propagation and Space Trajectory Visualization

  • Shirazi, A.
  • Ceberio, J.
  • Lozano, J.A.
In this paper, an interactive tool for simulation of satellites dynamics and autonomous spacecraft guidance is presented. Different geopotential models for orbit propagation of Earth-orbiting satellites are provided, which consider Earth's gravitational field with various accuracies. The presented software is a 3D visualization platform for space orbit simulation with analytical capabilities through various modules. Taking advantage of a graphical user interface, it can evaluate, analyze and illustrate the motion of satellite based on different orbit propagation schemes. Several cases of satellites and autonomous spacecraft in the space rendezvous mission are simulated regarding different propagation models to demonstrate the performance of the application in space mission analysis, ground track visualization and trajectory optimization. Results are validated by comparing with other state-of-the-art tools, such as AGI System Toolkit (STK)., La Caixa Foundation SEV-2017-0718 TIN2016-78365R PID2019-1064536A-I00 Basque Government consolidated groups 2019-2021 IT1244-19
BIRD. BCAM's Institutional Repository Data
Publicación Tesis doctoral (DoctoralThesis)

Efficient meta-heuristics for spacecraft trajectory optimization

  • Shirazi, A.
Meta-heuristics has a long tradition in computer science. During the past few years, different types of meta-heuristics, specially evolutionary algorithms got noticeable attention in dealing with real-world optimization problems. Recent advances in this field along with rapid development of high processing computers, make it possible to tackle various engineering optimization problems with relative ease, omitting the barrier of unknown global optimal solutions due to the complexity of the problems. Following this rapid advancements, scientific communities shifted their attention towards the development of novel algorithms and techniques to satisfy their need in optimization. Among different research areas, astrodynamics and space engineering witnessed many trends in evolutionary algorithms for various types of problems. By having a look at the amount of publications regarding the development of meta-heuristics in aerospace sciences, it can be seen that a high amount of efforts are dedicated to develop novel stochastic techniques and more specifically, innovative evolutionary algorithms on a variety of subjects. In the past decade, one of the challenging problems in space engineering, which is tackled mainly by novel evolutionary algorithms by the researchers in the aerospace community is spacecraft trajectory optimization. Spacecraft trajectory optimization problem can be simply described as the discovery of a space trajectory for satellites and space vehicles that satisfies some criteria. While a space vehicle travels in space to reach a destination, either around the Earth or any other celestial body, it is crucial to maintain or change its flight path precisely to reach the desired final destination. Such travels between space orbits, called orbital maneuvers, need to be accomplished, while minimizing some objectives such as fuel consumption or the transfer time. In the engineering point of view, spacecraft trajectory optimization can be described as a black-box optimization problem, which can be constrained or unconstrained, depending on the formulation of the problem. In order to clarify the main motivation of the research in this thesis, first, it is necessary to discuss the status of the current trends in the development of evolutionary algorithms and tackling spacecraft trajectory optimization problems. Over the past decade, numerous research are dedicated to these subjects, mainly from two groups of scientific communities. The first group is the space engineering community. Having an overall look into the publications confirms that the focus in the developed methods in this group is mainly regarding the mathematical modeling and numerical approaches in dealing with spacecraft trajectory optimization problems. The majority of the strategies interact with mixed concepts of semi-analytical methods, discretization, interpolation and approximation techniques. When it comes to optimization, usually traditional algorithms are utilized and less attention is paid to the algorithm development. In some cases, researchers tried to tune the algorithms and make them more efficient. However, their efforts are mainly based on try-and-error and repetitions rather than analyzing the landscape of the optimization problem. The second group is the computer science community. Unlike the first group, the majority of the efforts in the research from this group has been dedicated to algorithm development, rather than developing novel techniques and approaches in trajectory optimization such as interpolation and approximation techniques. Research in this group generally ends in very efficient and robust optimization algorithms with high performance. However, they failed to put their algorithms in challenge with complex real-world optimization problems, with novel ideas as their model and approach. Instead, usually the standard optimization benchmark problems are selected to verify the algorithm performance. In particular, when it comes to solve a spacecraft trajectory optimization problem, this group mainly treats the problem as a black-box with not much concentration on the mathematical model or the approximation techniques. Taking into account the two aforementioned research perspectives, it can be seen that there is a missing link between these two schemes in dealing with spacecraft trajectory optimization problems. On one hand, we can see noticeable advances in mathematical models and approximation techniques on this subject, but with no efforts on the optimization algorithms. On the other hand, we have newly developed evolutionary algorithms for black-box optimization problems, which do not take advantage of novel approaches to increase the efficiency of the optimization process. In other words, there seems to be a missing connection between the characteristics of the problem in spacecraft trajectory optimization, which controls the shape of the solution domain, and the algorithm components, which controls the efficiency of the optimization process. This missing connection motivated us in developing efficient meta-heuristics for solving spacecraft trajectory optimization problems. By having the knowledge about the type of space mission, the features of the orbital maneuver, the mathematical modeling of the system dynamics, and the features of the employed approximation techniques, it is possible to adapt the performance of the algorithms. Knowing these features of the spacecraft trajectory optimization problem, the shape of the solution domain can be realized. In other words, it is possible to see how sensitive the problem is relative to each of its feature. This information can be used to develop efficient optimization algorithms with adaptive mechanisms, which take advantage of the features of the problem to conduct the optimization process toward better solutions. Such flexible adaptiveness, makes the algorithm robust to any changes of the space mission features. Therefore, within the perspective of space system design, the developed algorithms will be useful tools for obtaining optimal or near-optimal transfer trajectories within the conceptual and preliminary design of a spacecraft for a space mission. Having this motivation, the main goal in this research was the development of efficient meta-heuristics for spacecraft trajectory optimization. Regarding the type of the problem, we focused on space rendezvous problems, which covers the majority of orbital maneuvers, including long-range and short-range space rendezvous. Also, regarding the meta-heuristics, we concentrated mainly on evolutionary algorithms based on probabilistic modeling and hybridization. Following the research, two algorithms have been developed. First, a hybrid self adaptive evolutionary algorithm has been developed for multi-impulse long-range space rendezvous problems. The algorithm is a hybrid method, combined with auto-tuning techniques and an individual refinement procedure based on probabilistic distribution. Then, for the short-range space rendezvous trajectory optimization problems, an estimation of distribution algorithm with feasibility conserving mechanisms for constrained continuous optimization is developed. The proposed mechanisms implement seeding, learning and mapping methods within the optimization process. They include mixtures of probabilistic models, outlier detection algorithms and some heuristic techniques within the mapping process. Parallel to the development of algorithms, a simulation software is also developed as a complementary application. This tool is designed for visualization of the obtained results from the experiments in this research. It has been used mainly to obtain high-quality illustrations while simulating the trajectory of the spacecraft within the orbital maneuvers., La Caixa TIN2016-78365R PID2019-1064536A-I00 Basque Government consolidated groups 2019-2021 IT1244-19
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

On the fair comparison of optimization algorithms in different machines

  • Arza, E.
  • Pérez, A.
  • Ceberio, J.
  • Irurozki, E.
An experimental comparison of two or more optimization algorithms requires the same computational resources to be assigned to each algorithm. When a maximum runtime is set as the stopping criterion, all algorithms need to be executed in the same machine if they are to use the same resources. Unfortunately, the implementation code of the algorithms is not always available, which means that running the algorithms to be compared in the same machine is not always possible. And even if they are available, some optimization algorithms might be costly to run, such as training large neural-networks in the cloud. In this paper, we consider the following problem: how do we compare the performance of a new optimization algorithm B with a known algorithm A in the literature if we only have the results (the objective values) and the runtime in each instance of algorithm A? Particularly, we present a methodology that enables a statistical analysis of the performance of algorithms executed in different machines. The proposed methodology has two parts. Firstly, we propose a model that, given the runtime of an algorithm in a machine, estimates the runtime of the same algorithm in another machine. This model can be adjusted so that the probability of estimating a runtime longer than what it should be is arbitrarily low. Secondly, we introduce an adaptation of the one-sided sign test that uses a modified p-value and takes into account that probability. Such adaptation avoids increasing the probability of type I error associated with executing algorithms A and B in different machines., PID2019-1064536A-I00 Basque Government through consolidated groups 2019-2021 IT1244-19
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

Statistical model for reproducibility in ranking-based feature selection

  • Urkullu, A.
  • Pérez, A.
  • Calvo, B.
The stability of feature subset selection algorithms has become crucial in real-world problems due to the need for consistent experimental results across different replicates. Specifically, in this paper, we analyze the reproducibility of ranking-based feature subset selection algorithms. When applied to data, this family of algorithms builds an ordering of variables in terms of a measure of relevance. In order to quantify the reproducibility of ranking-based feature subset selection algorithms, we propose a model that takes into account all the different sized subsets of top-ranked features. The model is fitted to data through the minimization of an error function related to the expected values of Kuncheva’s consistency index for those subsets. Once it is fitted, the model provides practical information about the feature subset selection algorithm analyzed, such as a measure of its expected reproducibility or its estimated area under the receiver operating characteristic curve regarding the identification of relevant features. We test our model empirically using both synthetic and a wide range of real data. The results show that our proposal can be used to analyze feature subset selection algorithms based on rankings in terms of their reproducibility and their performance.
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

A cheap feature selection approach for the K -means algorithm

  • Capo, M.
  • Pérez, A.
  • Lozano, J.A.
The increase in the number of features that need to be analyzed in a wide variety of areas, such as genome sequencing, computer vision or sensor networks, represents a challenge for the K-means algorithm. In this regard, different dimensionality reduction approaches for the K-means algorithm have been designed recently, leading to algorithms that have proved to generate competitive clusterings. Unfortunately, most of these techniques tend to have fairly high computational costs and/or might not be easy to parallelize. In this work, we propose a fully-parellelizable feature selection technique intended for the K-means algorithm. The proposal is based on a novel feature relevance measure that is closely related to the K-means error of a given clustering. Given a disjoint partition of the features, the technique consists of obtaining a clustering for each subset of features and selecting the m features with the highest relevance measure. The computational cost of this approach is just O(m · max{n · K, log m}) per subset of features. We additionally provide a theoretical analysis on the quality of the obtained solution via our proposal, and empirically analyze its performance with respect to well-known feature selection and feature extraction techniques. Such an analysis shows that our proposal consistently obtains results with lower K-means error than all the considered feature selection techniques: Laplacian scores, maximum variance, multi-cluster feature selection and random selection, while also requiring similar or lower computational times than these approaches. Moreover, when compared to feature extraction techniques, such as Random Projections, the proposed approach also shows a noticeable improvement in both error and computational time., BERC 2014-2017
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

Statistical assessment of experimental results: a graphical approach for comparing algorithms

  • Arza, E.
  • Ceberio, J.
  • Irurozki, E.
  • Pérez, A.
Non-deterministic measurements are common in real-world scenarios: the performance of a stochastic optimization algorithm or the total reward of a reinforcement learning agent in a chaotic environment are just two examples in which unpredictable outcomes are common. These measures can be modeled as random variables and compared among each other via their expected values or more sophisticated tools such as null hypothesis statistical tests. In this paper, we propose an alternative framework to compare two random variables according to their cumulative distribution functions. First, we introduce a dominance measure for two random variables that quantifies the proportion in which the cumulative distribution function of one of the random variables is greater than the other. Then, we present a graphical method that allows a visual estimation of the proposed dominance measure, the probability that one of the random variables takes lower values than the other, and a comparison of quantiles of the random variables. With illustrative purposes, we re-evaluate the experimentation of an already published work with the proposed methodology and we show that additional conclusions—missed by the rest of the methods—can be inferred. Additionally, a software package is provided as a convenient way of applying the proposed framework., Basque Government through the Research Groups 2019-2021 IT1244-19 Spanish Ministry of Science, Innovation and Universities through PID2019-106453GA-I00/AEI/10.13039/501100011033
BIRD. BCAM's Institutional Repository Data
Publicación Tesis doctoral (DoctoralThesis)

Contributions to Time Series Classification: Meta-Learning and Explainability

  • Abanda, A.
This thesis includes 3 contributions of different types to the area of supervised time series classification, a growing field of research due to the amount of time series collected daily in a wide variety of domains. In this context, the number of methods available for classifying time series is increasing, and the classifiers are becoming more and more competitive and varied. Thus, the first contribution of the thesis consists of proposing a taxonomy of distance-based time series classifiers, where an exhaustive review of the existing methods and their computational costs is made. Moreover, from the point of view of a non-expert user (even from that of an expert), choosing a suitable classifier for a given problem is a difficult task. The second contribution, therefore, deals with the recommendation of time series classifiers, for which we will use a meta-learning approach. Finally, the third contribution consists of proposing a method to explain the prediction of time series classifiers, in which we calculate the relevance of each region of a series in the prediction. This method of explanation is based on perturbations, for which we will consider specific and realistic transformations for the time series., BES-2016-076890
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

Time Series Classifier Recommendation by a Meta-Learning Approach

  • Abanda, A.
  • Mori, U.
  • Lozano, J.A.
This work addresses time series classifier recommendation for the first time in the literature by considering several recommendation forms or meta-targets: classifier accuracies, complete ranking, top-M ranking, best set and best classifier. For this, an ad-hoc set of quick estimators of the accuracies of the candidate classifiers (landmarkers) are designed, which are used as predictors for the recommendation system. The performance of our recommender is compared with the performance of a standard method for non-sequential data and a set of baseline methods, which our method outperforms in 7 of the 9 considered scenarios. Since some meta-targets can be inferred from the predictions of other more fine-grained meta-targets, the last part of the work addresses the hierarchical inference of meta-targets. The experimentation suggests that, in many cases, a single model is sufficient to output many types of meta-targets with competitive results.
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Rank aggregation for non-stationary data streams

  • Irurozki, E.
  • Pérez, A.
  • Lobo, J.L.
  • Del Ser, J.
The problem of learning over non-stationary ranking streams arises naturally, particularly in recommender systems. The rankings represent the preferences of a population, and the non-stationarity means that the distribution of preferences changes over time. We propose an algorithm that learns the current distribution of ranking in an online manner. The bottleneck of this process is a rank aggregation problem. We propose a generalization of the Borda algorithm for non-stationary ranking streams. As a main result, we bound the minimum number of samples required to output the ground truth with high probability. Besides, we show how the optimal parameters are set. Then, we generalize the whole family of weighted voting rules (the family to which Borda belongs) to situations in which some rankings are more reliable than others. We show that, under mild assumptions, this generalization can solve the problem of rank aggregation over non-stationary data streams.
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

An active adaptation strategy for streaming time series classification based on elastic similarity measures

  • Oregi, I.
  • Pérez, A.
  • Del Ser, J.
  • Lozano, J.A.
In streaming time series classification problems, the goal is to predict the label associated to the most recently received observations over the stream according to a set of categorized reference patterns. In on-line scenarios, data arise from non-stationary processes, which results in a succession of different patterns or events. This work presents an active adaptation strategy that allows time series classifiers to accommodate to the dynamics of streamed time series data. Specifically, our approach consists of a classifier that detects changes between events over streaming time series. For this purpose, the classifier uses features of the dynamic time warping measure computed between the streamed data and a set of reference patterns. When classifying a streaming series, the proposed pattern end detector analyzes such features to predict changes and adapt off-line time series classifiers to newly arriving events. To evaluate the performance of the proposed scheme, we employ the pattern end detection model along with dynamic time warping-based nearest neighbor classifiers over a benchmark of ten time series classification problems. The obtained results present exciting insights into the detection accuracy and latency performance of the proposed strategy., BERC-2022-205
BIRD. BCAM's Institutional Repository Data
Publicación Artículo científico (JournalArticle)

Ad-Hoc Explanation for Time Series Classification

  • Abanda, A.
  • Mori, U.
  • Lozano, J.A.
In this work, a perturbation-based model-agnostic explanation method for time series classification is presented. One of the main novelties of the proposed method is that the considered perturbations are interpretable and specific for time series. In real-world time series, variations in the speed or the scale of a particular action, for instance, may determine the class, so modifying this type of characteristic leads to ad-hoc explanations for time series. To this end, four perturbations or transformations are proposed: warp, scale, noise, and slice. Given a transformation, an interval of a series is considered relevant for the prediction of a classifier if a transformation in this interval changes the prediction. Another novelty is that the method provides a two-level explanation: a high-level explanation, where the robustness of the prediction with respect to a particular transformation is measured, and a low-level explanation, where the relevance of each region of the time series in the prediction is visualized. In order to analyze and validate our proposal, first some illustrative examples are provided, and then a thorough quantitative evaluation is carried out using a specifically designed evaluation procedure., PID2019-104966GB-I00 3KIA-KK2020/0049
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Contribución de congreso (ConferenceOutput)

Approximating the maximum weighted decomposable graph problem with applications to probabilistic graphical models

  • Pérez, Aritz
  • Blum, Christian
  • Lozano, Jose A.
Trabajo presentado en International Conference on Probabilistic Graphical Models (PGM 2018), celebrada en Praga (República Checa), del 11 al 14 de septiembre de2018, In this work we deal with the problem of learning a maximum weighted (k+1)-order decomposable graph coarser than a given maximal k-order decomposable graph (also known as hypertree of treewidth k − 1). An Integer Linear Programming formulation for the problem has recently been proposed and used in order to solve instances of the problem with a moderate number of vertices. However, as the problem is known to be NP-hard, it is of practical interest to develop approximate algorithms able to work with a limited amount of computational resources. In this paper we propose an approximate Integer Linear Programming formulation for the problem using a threshold distance which discards the edges that, on average, have a low probability of being contained in the solution. Experiments have been carried out with weighted graphs and probabilistic graphical models. Using the proposed formulation we have obtained results close to the optimum, even when most of the candidate edges were discarded using the distance criterion. The obtained good results indicate that the approximate formulation has important applications for learning probabilistic graphical models using decomposable scores, e.g., BDe, This work has been partially supported by the Basque Government through the BERC 2014-2017 and the ELKARTEK programs, and by the Spanish Ministry of Economy and Competitiveness MINECO: BCAM Severo Ochoa excellence accreditation SVP-2014-068574 and SEV-2013-0323, and through the project TIN2017-82626-R funded by (AEI/FEDER, UE)., Peer reviewed